On one NP-complete problem.

Jirí Demel Marie Demlová

Published in: Kybernetika (1995)

Keyphrases

np complete
np hard
randomly generated
computational complexity
constraint satisfaction problems
satisfiability problem
polynomial time complexity
phase transition
np complete problems
conjunctive queries
artificial intelligence
polynomially solvable
multi agent
upper bound
data warehouse