Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach

Eriksson, L., Lagerkvist, V., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (3 more authors) (Accepted: 2026) Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach. In: Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning. 23rd International Conference on Principles of Knowledge Representation and Reasoning, 20-23 Jul 2026, Lisbon, Portugal. . KR. (In Press)

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Dates:
  • Accepted: 13 April 2026
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Date Deposited: 13 May 2026 09:58
Last Modified: 13 May 2026 09:58
Status: In Press
Publisher: KR
Open Archives Initiative ID (OAI ID):

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Export

Statistics


CORE (COnnecting REpositories)