Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Moritz MüllerStefan SzeiderPublished in: MFCS (2013)
Keyphrases
- bounded treewidth
- space complexity
- search space
- np complete
- space requirements
- decision problems
- computational complexity
- low dimensional
- neural network
- boolean functions
- computational cost
- upper bound
- parameter space
- memory requirements
- conjunctive queries
- higher dimensional
- high dimensional
- worst case
- space time
- search algorithm
- machine learning