Media Summary: Toniann Pitassi (University of Toronto) Meta- Computer Science/Discrete Mathematics Seminar II Topic: Short talks by postdoctoral members Topic:

Proof Complexity A - Detailed Analysis & Overview

Toniann Pitassi (University of Toronto) Meta- Computer Science/Discrete Mathematics Seminar II Topic: Short talks by postdoctoral members Topic: Logical Perspectives 2025: Open Lectures A.A. Razborov. Propositional Proof Complexity September 8, 2025 16:00–17:15, Steklov ... Computer Science/Discrete Mathematics Seminar II Topic: A Brief Tour of Abstract: In this talk, we will survey the landscape of algebraic

Olaf Beyersdorff (Friedrich Schiller University Jena) ... Sasha Razborov (University of Chicago) Theoretical ...

Photo Gallery

Proof Complexity and Meta-Complexity Tutorial (1)
Proof complexity - an introduction - Avi Wigderson
Proof complexity as a computational lens lecture 1: Introduction
Proof Complexity A
Proof and Circuit Complexity - Robert Robere
How to Prove or Disprove Big-O - Introduction to Computer Science
A.A. Razborov. Propositional Proof Complexity
A Brief Tour of Proof Complexity: Lower Bounds and Open Problems - Toniann Pitassi
Susanna de Rezende and Kilian Risse - Algebraic Proof Systems
Connections Between QBF Proof Complexity and Circuit Complexity
Proof Complexity and Meta-Complexity Tutorial (2)
P, NP and Proof Complexity
View Detailed Profile
Proof Complexity and Meta-Complexity Tutorial (1)

Proof Complexity and Meta-Complexity Tutorial (1)

Toniann Pitassi (University of Toronto) https://simons.berkeley.edu/talks/tbd-37 Meta-

Proof complexity - an introduction - Avi Wigderson

Proof complexity - an introduction - Avi Wigderson

Computer Science/Discrete Mathematics Seminar II Topic:

Proof complexity as a computational lens lecture 1: Introduction

Proof complexity as a computational lens lecture 1: Introduction

Thursday Oct 30, 2025

Proof Complexity A

Proof Complexity A

Sam Buss (UC San Diego) https://simons.berkeley.edu/talks/

Proof and Circuit Complexity - Robert Robere

Proof and Circuit Complexity - Robert Robere

Short talks by postdoctoral members Topic:

How to Prove or Disprove Big-O - Introduction to Computer Science

How to Prove or Disprove Big-O - Introduction to Computer Science

In this video, I will show you how to

A.A. Razborov. Propositional Proof Complexity

A.A. Razborov. Propositional Proof Complexity

Logical Perspectives 2025: Open Lectures A.A. Razborov. Propositional Proof Complexity September 8, 2025 16:00–17:15, Steklov ...

A Brief Tour of Proof Complexity: Lower Bounds and Open Problems - Toniann Pitassi

A Brief Tour of Proof Complexity: Lower Bounds and Open Problems - Toniann Pitassi

Computer Science/Discrete Mathematics Seminar II Topic: A Brief Tour of

Susanna de Rezende and Kilian Risse - Algebraic Proof Systems

Susanna de Rezende and Kilian Risse - Algebraic Proof Systems

Abstract: In this talk, we will survey the landscape of algebraic

Connections Between QBF Proof Complexity and Circuit Complexity

Connections Between QBF Proof Complexity and Circuit Complexity

Olaf Beyersdorff (Friedrich Schiller University Jena) ...

Proof Complexity and Meta-Complexity Tutorial (2)

Proof Complexity and Meta-Complexity Tutorial (2)

Toniann Pitassi (University of Toronto) https://simons.berkeley.edu/talks/tbd-37 Meta-

P, NP and Proof Complexity

P, NP and Proof Complexity

Sasha Razborov (University of Chicago) https://simons.berkeley.edu/talks/sat-and-foundations-mathematics Theoretical ...

Proof Complexity D

Proof Complexity D

Sam Buss (UC San Diego) https://simons.berkeley.edu/talks/