Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.
Ruiwen ChenValentine KabanetsPublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- worst case
- computational complexity
- data structure
- worst case bounds
- search strategies
- computational cost
- memory requirements
- space complexity
- theoretical analysis
- upper and lower bounds
- small size
- average case
- propositional satisfiability
- computationally efficient
- error bounds
- lower bound
- constant factor
- stochastic local search algorithms
- learning algorithm