The Complexity of Boolean Surjective General-Valued CSPs.

Peter Fulla, Stanislav Zivn

Browse the full MFCS paper archive.