The Complexity of Boolean Surjective General-Valued CSPs.

Peter Fulla Hannes Uppman Stanislav Zivný

Published in: ACM Trans. Comput. Theory (2019)

Keyphrases

special case
constraint satisfaction problems
closely related
constraint satisfaction
real valued
computational complexity
boolean functions
real time
neural network
upper bound
temporal constraints