Lower bounds for Pólya's problem on permanent.
Mikhail BudrevichGregor DolinarAlexander E. GutermanBojan KuzmaPublished in: Int. J. Algebra Comput. (2016)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- upper and lower bounds
- lower bounding
- objective function
- worst case
- optimal solution
- set of randomly generated instances
- machine learning
- randomly generated problems
- database
- constraint satisfaction problems
- quadratic assignment problem
- optimal cost
- search algorithm
- data structure
- max sat
- concept class