Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF

Fichte, JK, Ganian, R, Hecher, M et al. (2 more authors) (2023) Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 26-29 Jun 2023, Boston, USA. IEEE ISBN 979-8-3503-3587-3

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Keywords: Computer science, Upper bound, Probabilistic logic, Filling, Complexity theory, Structural engineering, Standards
Dates:
  • Published: 14 July 2023
  • Published (online): 14 July 2023
  • Accepted: 5 April 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
Funder
Grant number
EPSRC (Engineering and Physical Sciences Research Council)
EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 26 Apr 2023 13:58
Last Modified: 06 Dec 2024 16:37
Status: Published
Publisher: IEEE
Identification Number: 10.1109/LICS56636.2023.10175675
Open Archives Initiative ID (OAI ID):

Export

Statistics