Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Complexity of Boolean Surjective General-Valued CSPs."

Peter Fulla, Hannes Uppman, Stanislav Zivný (2019)

> Home

Details and statistics

DOI: 10.1145/3282429

access: closed

type: Journal Article

metadata version: 2022-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/FullaUZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/FullaUZ19
Peter Fulla, Hannes Uppman, Stanislav Zivný:
The Complexity of Boolean Surjective General-Valued CSPs. ACM Trans. Comput. Theory 11(1): 4:1-4:31 (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.