Using decomposition-parameters for QBF: Mind the prefix!

Eiben, E, Ganian, R and Ordyniak, S orcid.org/0000-0003-1935-651X (2020) Using decomposition-parameters for QBF: Mind the prefix! Journal of Computer and System Sciences, 110. pp. 1-21. ISSN 0022-0000

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2020, Elsevier. All rights reserved. This is an author produced version of an article published in Journal of Computer and System Sciences. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Quantified Boolean formulas; Dependency schemes; Treewidth; Pathwidth; Parameterized complexity
Dates:
  • Accepted: 21 December 2019
  • Published (online): 8 January 2020
  • Published: June 2020
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 13 Nov 2020 15:17
Last Modified: 08 Jan 2021 01:39
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.jcss.2019.12.005
Related URLs:

Download

Filename: main.pdf

Licence: CC-BY-NC-ND 4.0

Export

Statistics