Automating OBDD proofs is NP-hard.
Dmitry ItsyksonArtur RiazanovPublished in: Electron. Colloquium Comput. Complex. (2022)
Keyphrases
- np hard
- special case
- optimal solution
- approximation algorithms
- scheduling problem
- boolean functions
- np complete
- lower bound
- worst case
- linear programming
- integer programming
- remains np hard
- ordered binary decision diagrams
- np hardness
- branch and bound algorithm
- decision problems
- minimum cost
- mathematical proofs
- constraint satisfaction problems
- closely related
- formal proofs
- knapsack problem
- computational complexity
- model counting
- natural deduction
- theorem prover
- learning algorithm
- approximation ratio
- set cover
- greedy heuristic
- equational theories
- model checking
- randomly generated problem instances