Backdoors into heterogeneous classes of SAT and CSP
In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets t...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2016
|
| _version_ | 1797104685582123008 |
|---|---|
| author | Gaspers, S Misra, N Ordyniak, S Szeider, S Zivny, S |
| author_facet | Gaspers, S Misra, N Ordyniak, S Szeider, S Zivny, S |
| author_sort | Gaspers, S |
| collection | OXFORD |
| description | In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets to heterogeneous base classes can be much smaller than backdoor sets to homogeneous ones, hence they are much more desirable but possibly harder to find. We draw a detailed complexity landscape for the problem of detecting strong and weak backdoor sets into heterogeneous base classes for SAT and CSP. |
| first_indexed | 2024-03-07T06:37:03Z |
| format | Journal article |
| id | oxford-uuid:f802cbe2-9158-4bc1-88ea-63ff070081fd |
| institution | University of Oxford |
| last_indexed | 2024-03-07T06:37:03Z |
| publishDate | 2016 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:f802cbe2-9158-4bc1-88ea-63ff070081fd2022-03-27T12:47:05ZBackdoors into heterogeneous classes of SAT and CSPJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:f802cbe2-9158-4bc1-88ea-63ff070081fdSymplectic Elements at OxfordElsevier2016Gaspers, SMisra, NOrdyniak, SSzeider, SZivny, SIn this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets to heterogeneous base classes can be much smaller than backdoor sets to homogeneous ones, hence they are much more desirable but possibly harder to find. We draw a detailed complexity landscape for the problem of detecting strong and weak backdoor sets into heterogeneous base classes for SAT and CSP. |
| spellingShingle | Gaspers, S Misra, N Ordyniak, S Szeider, S Zivny, S Backdoors into heterogeneous classes of SAT and CSP |
| title | Backdoors into heterogeneous classes of SAT and CSP |
| title_full | Backdoors into heterogeneous classes of SAT and CSP |
| title_fullStr | Backdoors into heterogeneous classes of SAT and CSP |
| title_full_unstemmed | Backdoors into heterogeneous classes of SAT and CSP |
| title_short | Backdoors into heterogeneous classes of SAT and CSP |
| title_sort | backdoors into heterogeneous classes of sat and csp |
| work_keys_str_mv | AT gasperss backdoorsintoheterogeneousclassesofsatandcsp AT misran backdoorsintoheterogeneousclassesofsatandcsp AT ordyniaks backdoorsintoheterogeneousclassesofsatandcsp AT szeiders backdoorsintoheterogeneousclassesofsatandcsp AT zivnys backdoorsintoheterogeneousclassesofsatandcsp |