- Language
-
Englisch
- Identifier
-
sid~55842
- Series
-
Proof Complexity (20w5144), (Jan. 2020)
Subject
Workshop/Interaktives Format
Contributor
Fleming, Noah
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Nordström, Jakob (Organization)
Atserias, Albert (Organization)
Pudlak, Pavel (Organization)
Santhanam, Rahul (Organization)
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Nordström, Jakob (Organization)
Atserias, Albert (Organization)
Pudlak, Pavel (Organization)
Santhanam, Rahul (Organization)
Published
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery, 2020
- DOI
- Rights
-
Nähere Angaben zur Lizenz und den Nutzungsbedingungen unter: https://av.tib.eu/media/55842
- Last update
-
18.04.2023, 12:34 PM CEST
Object type
- Audiovisuelles Material
Associated
- Fleming, Noah
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- Nordström, Jakob (Organization)
- Atserias, Albert (Organization)
- Pudlak, Pavel (Organization)
- Santhanam, Rahul (Organization)
Time of origin
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery, 2020
Other Objects (12)
(Semi)Algebraic Proofs over {±1} Variables
The Surprising Power of Constant Depth Algebraic Proofs
Size-Degree Trade-Off for Sums-of-Squares Proofs
Semi-Algebraic Proofs, IPS Lower Bounds and the τ -Conjecture: Can a Natural Number be Negative?
On Depth 1 Frege Systems
Automating Resolution is NP-Hard
Characterising QBF Hardness via Circuit Complexity
Lifting Applied to Proof Complexity
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
Why are Proof Complexity Lower Bounds Hard?
Resolution and the binary encodings of combinatorial principles
k-Clique and Regular vs. General Resolution
(Semi)Algebraic Proofs over {±1} Variables
The Surprising Power of Constant Depth Algebraic Proofs
Size-Degree Trade-Off for Sums-of-Squares Proofs
Semi-Algebraic Proofs, IPS Lower Bounds and the τ -Conjecture: Can a Natural Number be Negative?
On Depth 1 Frege Systems
Automating Resolution is NP-Hard
Characterising QBF Hardness via Circuit Complexity
Lifting Applied to Proof Complexity
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
Why are Proof Complexity Lower Bounds Hard?
Resolution and the binary encodings of combinatorial principles
k-Clique and Regular vs. General Resolution
(Semi)Algebraic Proofs over {±1} Variables
The Surprising Power of Constant Depth Algebraic Proofs
Size-Degree Trade-Off for Sums-of-Squares Proofs
Semi-Algebraic Proofs, IPS Lower Bounds and the τ -Conjecture: Can a Natural Number be Negative?
On Depth 1 Frege Systems
Automating Resolution is NP-Hard
Characterising QBF Hardness via Circuit Complexity
Lifting Applied to Proof Complexity
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
Why are Proof Complexity Lower Bounds Hard?
Resolution and the binary encodings of combinatorial principles