Autoreducibility of NP-Complete Sets.

John M. Hitchcock Hadi Shafei

Published in: CoRR (2016)

Keyphrases

np complete
randomly generated
np hard
logical equivalence
constraint satisfaction problems
satisfiability problem
data sets
pspace complete
conjunctive queries
multi agent
definite clause
polynomially solvable
polynomial time complexity
databases
branch and bound