Parameterized complexity of DPLL search procedures

Beyersdorff, O, Galesi, N and Lauria, M (2011) Parameterized complexity of DPLL search procedures. In: Sakallah, KA and Simon, L, (eds.) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011, 19 - 22 June 2011, Ann Arbor, MI, USA. Springer Verlag , 5 - 18 . ISBN 978-3-642-21580-3

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Galesi, N
  • Lauria, M
Copyright, Publisher and Additional Information: © 2011, Springer Verlag. This is an author produced version of a paper published in Theory and Applications of Satisfiability Testing - SAT 2011. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com
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: 03 Dec 2012 10:37
Last Modified: 25 Oct 2016 10:05
Published Version: http://dx.doi.org/10.1007/978-3-642-21581-0_3
Status: Published
Publisher: Springer Verlag
Identification Number: https://doi.org/10.1007/978-3-642-21581-0_3

Download

Filename: final-version-sat11.pdf

Share / Export

Statistics