Media Summary: Proof systems for MaxSAT Ilario Bonacina, Universitat Politecnica de Catalunya Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers Iddo Tzameret, Imperial College London ... TFNP Intersections and Feasible Disjunction Neil Thapen, Institute of Mathematics of the Academy of Sciences of the Czech ...

Oberwolfach 2413 Propositional Proof Complexity - Detailed Analysis & Overview

Proof systems for MaxSAT Ilario Bonacina, Universitat Politecnica de Catalunya Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers Iddo Tzameret, Imperial College London ... TFNP Intersections and Feasible Disjunction Neil Thapen, Institute of Mathematics of the Academy of Sciences of the Czech ... Strength of the Dominance Rule Neil Thapen, Institute of Mathematics, Czech Academy of Sciences Tropical proof systems Edward A. Hirsch, Ariel University Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle Aaron Potechin, University of Chicago ...

Clique Is Hard on Average for Unary Sherali-Adams Kilian Risse, EPFL

Photo Gallery

Oberwolfach 2413: Propositional Proof Complexity and TFNP (Robert Robere)
Oberwolfach 2413: Quantified Propositional Calculi and Narrow Implicit Proofs (Pavel Pudlák)
Oberwolfach 2413: Proof systems for MaxSAT (Ilario Bonacina)
Oberwolfach 2413: Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting ... (Iddo Tzameret)
Oberwolfach 2413: Meta-Mathematics of Complexity Theory (Igor Carboni Oliveira)
Oberwolfach 2413: On the Algebraic Proof Complexity of Tensor Isomorphism (Nicola Galesi)
Oberwolfach 2413: TFNP Intersections and Feasible Disjunction (Neil Thapen)
Oberwolfach 2413: Strength of the Dominance Rule (Neil Thapen)
Oberwolfach 2413: Tropical proof systems (Edward A. Hirsch)
Oberwolfach 2413: Pebble games and Algebraic Proof Systems Meet Again (Jacobo Torán)
Oberwolfach 2413: Bounds on Total Coefficient Size of Nullstellensatz Proofs of PHP (Aaron Potechin)
Oberwolfach 2413: Clique Is Hard on Average for Unary Sherali-Adams (Kilian Risse)
View Detailed Profile
Oberwolfach 2413: Propositional Proof Complexity and TFNP (Robert Robere)

Oberwolfach 2413: Propositional Proof Complexity and TFNP (Robert Robere)

Propositional Proof Complexity

Oberwolfach 2413: Quantified Propositional Calculi and Narrow Implicit Proofs (Pavel Pudlák)

Oberwolfach 2413: Quantified Propositional Calculi and Narrow Implicit Proofs (Pavel Pudlák)

Quantified

Oberwolfach 2413: Proof systems for MaxSAT (Ilario Bonacina)

Oberwolfach 2413: Proof systems for MaxSAT (Ilario Bonacina)

Proof systems for MaxSAT Ilario Bonacina, Universitat Politecnica de Catalunya

Oberwolfach 2413: Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting ... (Iddo Tzameret)

Oberwolfach 2413: Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting ... (Iddo Tzameret)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers Iddo Tzameret, Imperial College London ...

Oberwolfach 2413: Meta-Mathematics of Complexity Theory (Igor Carboni Oliveira)

Oberwolfach 2413: Meta-Mathematics of Complexity Theory (Igor Carboni Oliveira)

Meta-Mathematics of

Oberwolfach 2413: On the Algebraic Proof Complexity of Tensor Isomorphism (Nicola Galesi)

Oberwolfach 2413: On the Algebraic Proof Complexity of Tensor Isomorphism (Nicola Galesi)

On the Algebraic

Oberwolfach 2413: TFNP Intersections and Feasible Disjunction (Neil Thapen)

Oberwolfach 2413: TFNP Intersections and Feasible Disjunction (Neil Thapen)

TFNP Intersections and Feasible Disjunction Neil Thapen, Institute of Mathematics of the Academy of Sciences of the Czech ...

Oberwolfach 2413: Strength of the Dominance Rule (Neil Thapen)

Oberwolfach 2413: Strength of the Dominance Rule (Neil Thapen)

Strength of the Dominance Rule Neil Thapen, Institute of Mathematics, Czech Academy of Sciences

Oberwolfach 2413: Tropical proof systems (Edward A. Hirsch)

Oberwolfach 2413: Tropical proof systems (Edward A. Hirsch)

Tropical proof systems Edward A. Hirsch, Ariel University

Oberwolfach 2413: Pebble games and Algebraic Proof Systems Meet Again (Jacobo Torán)

Oberwolfach 2413: Pebble games and Algebraic Proof Systems Meet Again (Jacobo Torán)

Pebble games and Algebraic

Oberwolfach 2413: Bounds on Total Coefficient Size of Nullstellensatz Proofs of PHP (Aaron Potechin)

Oberwolfach 2413: Bounds on Total Coefficient Size of Nullstellensatz Proofs of PHP (Aaron Potechin)

Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle Aaron Potechin, University of Chicago ...

Oberwolfach 2413: Clique Is Hard on Average for Unary Sherali-Adams (Kilian Risse)

Oberwolfach 2413: Clique Is Hard on Average for Unary Sherali-Adams (Kilian Risse)

Clique Is Hard on Average for Unary Sherali-Adams Kilian Risse, EPFL

Oberwolfach 2413: Proof Complexity, Communication Complexity, and Lifting (Susanna F. de Rezende)

Oberwolfach 2413: Proof Complexity, Communication Complexity, and Lifting (Susanna F. de Rezende)

Proof Complexity