External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Complexity of Boolean Surjective General-Valued CSPs

Peter Fulla, Stanislav Zivny. The Complexity of Boolean Surjective General-Valued CSPs. In Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, editors, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. Volume 83 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Authors

Peter Fulla

This author has not been identified. Look up 'Peter Fulla' in Google

Stanislav Zivny

This author has not been identified. Look up 'Stanislav Zivny' in Google
runs on