Backdoors into heterogeneous classes of SAT and CSP

Gaspers, S., Misra, N., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2017) Backdoors into heterogeneous classes of SAT and CSP. Journal of Computer and System Sciences, 85. pp. 38-56. ISSN 0022-0000

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2016 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Keywords: Constraint satisfaction; Satisfiability; Backdoor set; Parameterized complexity
Dates:
  • Published: May 2017
  • Published (online): 3 November 2016
  • Accepted: 23 October 2016
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 14 May 2018 14:49
Last Modified: 24 Oct 2018 10:11
Published Version: https://doi.org/10.1016/j.jcss.2016.10.007
Status: Published
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.jcss.2016.10.007
Related URLs:

Share / Export

Statistics