The Complexity of Boolean Surjective General-Valued CSPs

Peter Fulla, Hannes Uppman, Stanislav Zivny. The Complexity of Boolean Surjective General-Valued CSPs. TOCT, 11(1), 2019. [doi]

No reviews for this publication, yet.