ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Backdoors into heterogeneous classes of SAT and CSP

Gaspers, Serge and Misra, Neeldhara and Ordyniak, Sebastian and Szeider, Stefan and Zivny, Stanislav (2017) Backdoors into heterogeneous classes of SAT and CSP. In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 85 . pp. 38-56.

[img] PDF
Jou_Com_Sys_Sci_85_38_2017.pdf - Published Version
Restricted to Registered users only

Download (708kB) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.jcss.2016.10.007


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. (C) 2016 The Author(s). Published by Elsevier Inc.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the ACADEMIC PRESS INC ELSEVIER SCIENCE, 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495 USA
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 16 Feb 2017 05:56
Last Modified: 16 Feb 2017 05:56
URI: http://eprints.iisc.ac.in/id/eprint/56235

Actions (login required)

View Item View Item