Circuit size lower bounds and #SAT upper bounds through a general framework.
Alexander GolovnevAlexander S. KulikovAlexander SmalSuguru TamakiPublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- upper bound
- lower bound
- max sat
- lower and upper bounds
- upper and lower bounds
- branch and bound algorithm
- branch and bound
- worst case
- running times
- np hard
- constant factor
- objective function
- vc dimension
- memory requirements
- optimal solution
- sample size
- arbitrarily close
- lower bounding
- exact solution
- data structure
- tight upper and lower bounds
- linear programming relaxation
- cutting plane
- block size
- sat problem
- generalization error
- satisfiability problem
- phase transition
- high speed
- computational complexity
- search algorithm