Title	Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
Creator	Galesi, Nicola
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2020-01-23T16:32
Description	We prove that Tseitin formulas $Ts(G)$ for an undirected graph $G$, requires proofs of size $2^{tw(G)^{\Omega(1/d)}}$ in depth d-Frege systems for $d<{K \log n}/{\log \log n}$, where $tw(G)$ is the treewidth of $G$ and $K$ a constant. This extends H\r{a}stad recent lower bound for the grid graph to any graph. Furthermore, we prove tightness of our bound up to a multiplicative constant in the top exponent. The talk is based on a joint work with Dmitry Itsykson, Artur Ryazonov, Anastasia Sofronova.
Extent	30.0 minutes
Subject	Mathematics; Computer science; Mathematical logic and foundations; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Università degli Studi di Roma La Sapienza
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-07-22
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0392491
URI	http://hdl.handle.net/2429/75239
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