Parameterized complexity of DPLL search procedures

Beyersdorff, O, Galesi, N and Lauria, M (2013) Parameterized complexity of DPLL search procedures. ACM Transactions on Computational Logic, 14 (3). 20. ISSN 1529-3785

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Galesi, N
  • Lauria, M
Copyright, Publisher and Additional Information: © ACM, 2013. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Computational Logic, 14, 3, 20, 2013, http://doi.acm.org/10.1145/2499937.2499941
Keywords: Algorithms; complexity; parameterized complexity; proof; prover-delayer games; resolution; theory
Dates:
  • Published: August 2013
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 23 Jun 2014 10:20
Last Modified: 21 Jan 2018 03:07
Published Version: http://dx.doi.org/10.1145/2499937.2499941
Status: Published
Publisher: Association for Computing Machinery
Identification Number: https://doi.org/10.1145/2499937.2499941

Share / Export

Statistics