Title	QBF Proof Complexity
Creator	Beyersdorff, Olaf
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-08-29T10:16
Description	This talk will give an overview of the relatively young field of QBF proof complexity, explaining QBF proof systems (including QBF resolution, Frege and beyond). We will explore the simulation order of different QBF calculi and how they correspond to ideas in QBF solving. A particular focus of the talk will be on lower bound techniques for QBF systems and in particular new ideas, which do not just lift propositional hardness, but exploit hardness stemming from quantifier dependencies.
Extent	59.0
Subject	Mathematics; Computer science; Mathematical logic and foundations; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Leeds
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-04-01
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377716
URI	http://hdl.handle.net/2429/69378
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos