Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes.
Maurice J. JansenRahul SanthanamPublished in: STACS (2012)
Keyphrases
- lower bound
- worst case
- trade off
- complexity measures
- upper bound
- computational complexity
- np hard
- tractable cases
- branch and bound
- average case complexity
- np hardness
- decision problems
- branch and bound algorithm
- space complexity
- lower and upper bounds
- information theoretic
- bayesian networks
- approximation algorithms
- learning theory
- upper and lower bounds
- np complete
- data model
- objective function