The median problems for breakpoints are NP-complete

Itsik Pe'er Ron Shamir

Published in: Electron. Colloquium Comput. Complex. (1998)

Keyphrases

np complete
randomly generated
np hard
polynomial time complexity
np complete problems
pspace complete
data model
satisfiability problem
dynamic programming
optimization problems
constraint satisfaction
benchmark problems
computational complexity
problems involving
information systems
real world
real time