The Complexity of Boolean Surjective General-Valued CSPs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Peter Fulla, Stanislav Zivny

Journal title: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2017

DOI identifier: 10.4230/LIPIcs.MFCS.2017.4