The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Steffen ReithHeribert VollmerPublished in: CoRR (1998)
Keyphrases
- worst case
- optimal solution
- propositional logic
- computational complexity
- dynamic programming
- polynomial hierarchy
- horn clauses
- optimal design
- quantified boolean formulae
- neural network
- conjunctive normal form
- complexity analysis
- space complexity
- description logics
- computational cost
- relational databases
- search algorithm
- feature selection
- information systems
- machine learning