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 Published by Elsevier Inc. This is an author produced version of a paper subsequently published in Journal of Computer and System Sciences. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/).
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 Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 28 Apr 2020 14:23
Last Modified: 28 Apr 2020 14:23
Status: Published
Publisher: Elsevier
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.jcss.2019.12.005

Download

Accepted Version


Embargoed until: 8 January 2021

Filename: main.pdf

Licence: CC-BY-NC-ND 4.0

Request a copy

Share / Export

Statistics