"Algebra and the Complexity of Digraph CSPs: a Survey."

Benoît Larose (2017)

> Home

Details and statistics

DOI: 10.4230/DFU.VOL7.15301.10

access: open

type: Part in Book or Collection

metadata version: 2019-07-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/dagstuhl/Larose17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/Larose17
Benoît Larose:
Algebra and the Complexity of Digraph CSPs: a Survey. The Constraint Satisfaction Problem 2017: 267-285

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.