The Complexity of Boolean Surjective General-Valued CSPs.

Peter Fulla Stanislav Zivný

Published in: MFCS (2017)

Keyphrases

special case
worst case
real valued
constraint propagation
data sets
databases
information systems
computational complexity
constraint satisfaction problems
closely related
np hard
arc consistency