Papers

Peer-reviewed
2017

The Complexity of Boolean Surjective General-Valued CSPs

42nd International Symposium on Mathematical Foundations of Computer Science
  • P. Fulla
  • ,
  • S. Živný

First page
4:1
Last page
4:14
Language
English
Publishing type
Research paper (international conference proceedings)

Export
BibTeX RIS