Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Moritz MüllerStefan SzeiderPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- bounded treewidth
- space complexity
- search space
- np complete
- space requirements
- computational complexity
- upper bound
- worst case
- theorem proving
- databases
- higher dimensional
- machine learning
- low dimensional
- vector space
- parameter space
- conjunctive queries
- data management
- information systems
- information retrieval
- database