Backdoor DNFs

Ordyniak, S. orcid.org/0000-0003-1935-651X, Schidler, A. and Szeider, S. (2024) Backdoor DNFs. Journal of Computer and System Sciences, 144. 103547. ISSN 0022-0000

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2024 The Author(s). This is an open access article under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.

Keywords: Parameterized complexity; Backdoor sets/trees/DNFs; Boolean satisfiability; Distance to triviality
Dates:
  • Published: September 2024
  • Published (online): 31 May 2024
  • Accepted: 6 May 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Funding Information:
Funder
Grant number
EPSRC (Engineering and Physical Sciences Research Council)
EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 10 Jun 2024 13:11
Last Modified: 10 Jun 2024 13:11
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.jcss.2024.103547
Open Archives Initiative ID (OAI ID):

Export

Statistics