- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Bounded-Depth Frege Complexity of Tseitin Formulas...
Open Collections
BIRS Workshop Lecture Videos
Featured Collection
BIRS Workshop Lecture Videos
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs Galesi, Nicola
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
Item Metadata
| Title |
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
|
| Creator | |
| 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
|
| Extent |
30.0 minutes
|
| Subject | |
| Type | |
| File Format |
video/mp4
|
| Language |
eng
|
| Notes |
Author affiliation: Università degli Studi di Roma La Sapienza
|
| Series | |
| 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 | |
| Affiliation | |
| Peer Review Status |
Unreviewed
|
| Scholarly Level |
Faculty
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International