Login / Signup
The partitioned probe problem: NP-complete versus polynomial dichotomy.
Simone Dantas
Luérbio Faria
Celina M. H. de Figueiredo
Rafael B. Teixeira
Published in:
Discret. Appl. Math. (2018)
Keyphrases
</>
np complete
np hard
randomly generated
pspace complete
constraint satisfaction problems
fixed parameter tractable
data complexity
computational complexity
bounded treewidth
satisfiability problem
conjunctive queries
np complete problems
polynomial size
polynomially solvable
computationally complex