Autoreducibility of NP-Complete Sets under Strong Hypotheses.
John M. HitchcockHadi ShafeiPublished in: Comput. Complex. (2018)
Keyphrases
- np complete
- randomly generated
- np hard
- computational complexity
- constraint satisfaction problems
- logical equivalence
- pspace complete
- positive and negative examples
- phase transition
- sat problem
- satisfiability problem
- databases
- real world
- set theoretic
- neural network
- polynomially solvable
- polynomial time complexity
- data sets
- relational databases
- lower bound
- machine learning
- bounded treewidth
- hypothesis formation