A quadratic lower bound for the permanent and determinant problem over any characteristic != 2.
Jin-yi CaiXi ChenDong LiPublished in: STOC (2008)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- pairwise
- computational complexity
- worst case
- lower and upper bounds
- upper and lower bounds
- np hard
- service quality
- lagrangian relaxation
- linear programming relaxation
- lower bounding
- quadratic function
- sufficiently accurate
- information retrieval