Propositional lower bounds: Algorithms and complexity.
Marco CadoliLuigi PalopoliFrancesco ScarcelloPublished in: Ann. Math. Artif. Intell. (1999)
Keyphrases
- lower bound
- worst case
- computational cost
- computational complexity
- computationally efficient
- theoretical analysis
- online algorithms
- upper and lower bounds
- learning algorithm
- data structure
- optimization problems
- orders of magnitude
- times faster
- lower complexity
- running times
- high computational complexity
- space complexity
- propositional logic
- significant improvement
- bayesian networks