On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy.
Ishay HavivOded RegevAmnon Ta-ShmaPublished in: CoRR (2018)
Keyphrases
- computational complexity
- np complete
- bounded treewidth
- fixed parameter tractable
- phase transition
- np hardness
- satisfiability problem
- np hard
- worst case
- special case
- pattern matching
- acyclic conjunctive queries
- polynomial size
- random instances
- truth table
- randomly generated
- hierarchical structure
- conjunctive queries
- higher level
- approximation algorithms
- lower bound
- computational problems
- conjunctive normal form
- constraint satisfaction problems
- search algorithm
- stochastic local search
- sat problem
- orders of magnitude
- information theoretic