A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2012
|
| _version_ | 1797063573842690048 |
|---|---|
| author | Cooper, M Escamoche, G Živný, S |
| author_facet | Cooper, M Escamoche, G Živný, S |
| author_sort | Cooper, M |
| collection | OXFORD |
| description | |
| first_indexed | 2024-03-06T21:01:51Z |
| format | Conference item |
| id | oxford-uuid:3b243c5a-54dc-47c7-b7d3-6efd04d31291 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T21:01:51Z |
| publishDate | 2012 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:3b243c5a-54dc-47c7-b7d3-6efd04d312912022-03-26T14:05:50ZA Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSPConference itemhttp://purl.org/coar/resource_type/c_5794uuid:3b243c5a-54dc-47c7-b7d3-6efd04d31291Department of Computer ScienceSpringer2012Cooper, MEscamoche, GŽivný, S |
| spellingShingle | Cooper, M Escamoche, G Živný, S A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP |
| title | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP |
| title_full | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP |
| title_fullStr | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP |
| title_full_unstemmed | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP |
| title_short | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max−CSP |
| title_sort | characterisation of the complexity of forbidding subproblems in binary max csp |
| work_keys_str_mv | AT cooperm acharacterisationofthecomplexityofforbiddingsubproblemsinbinarymaxcsp AT escamocheg acharacterisationofthecomplexityofforbiddingsubproblemsinbinarymaxcsp AT zivnys acharacterisationofthecomplexityofforbiddingsubproblemsinbinarymaxcsp AT cooperm characterisationofthecomplexityofforbiddingsubproblemsinbinarymaxcsp AT escamocheg characterisationofthecomplexityofforbiddingsubproblemsinbinarymaxcsp AT zivnys characterisationofthecomplexityofforbiddingsubproblemsinbinarymaxcsp |