"A Characterisation of the Complexity of Forbidding Subproblems in Binary ..."

Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-33558-7_21

access: closed

type: Conference or Workshop Paper

metadata version: 2020-08-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cp/CooperEZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cp/CooperEZ12
Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. CP 2012: 265-273

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.