Mathematical theory of computation

FINITE AUTOMATA | THEORY OF AUTOMATA & FORMAL LANGUAGES | LECTURE 03 BY MS. VIBHA SRIVASTAVA | AKGE

VP, VNP and Algebraic Branching Programs over Min Plus Semirings by Harshil Mittal

The Natural Proofs Barrier Against Data-structure Lower-bounds by Bruno Loff

The Log-Rank Conjecture: New Equivalent Formulations by Lianna Hambardzumyan

Sum-of-Squares Lower Bounds for Average Case Problems by Aaron Potechin

Separations above TFNP from Sherali-Adams Lower Bounds by Deniz Imrek

Resolution Width Lifts to Near-Quadratic-Depth Res($\oplus$) Size by Dmitry Itsykson

On CC^0 Lower Bounds for AND via Torus Polynomials by Jayalal Sarma

Lower Bounds for Monotone Span programs by Robert Robere

IPS Lower Bounds for Formulas and Sum of ROABPs by Prerona Chatterjee

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication... by Duri Andrea Janett

An unconditional constant depth natural proof barrier: Bound by our own lower... by Suhail Sherif

A Randomness Hierarchy for Adversarially Robust Streaming Algorithms by Amit Chakrabarti

Svyatoslav Gryaznov | Weak Rank Principle and Circuit Lower-Bound Statements ( Part II )

Svyatoslav Gryaznov | Weak Rank Principle and Circuit Lower-Bound Statements ( Part I )

Prof. Roei Tell | Time vs Space vs Alternations: General Plasticity for Algorithms from Hardness ...

Lec 41: Bounded Model Checking

Lec 40: SAT based Symbolic Model Checking

Halley Goldberg | Asymmetry and Complexity of Nondeterministic Computations

Frontiers in complexity lower bounds [LFCW01] | Mon 7th September

Dr. Zhenjian Lu | Nondeterminism in Meta-Complexity

PUSHDOWN AUTOMATA | THEORY OF AUTOMATA AND FORMAL LANGUAGES | LECTURE 02 BY MR. AMIT GOEL | AKGEC

Quantum Algorithms Pt. 4 Optimization | Sabina Dragoi |QGSS26

Lec 28: CTL Encoding Exmaples

Lec 25: LTL_ Equivalence of Formulas, Adequate Set, Encoding Examples

Relation Algebra and the Limits of What Computers Can Decide Jas Semrl FAI CDT

Lec 24: LTL Encoding Examples

Lec 23: LTL: Syntax and Semantics

Sampling from the Sherrington-Kirkpatrick model up to β＜1/2

FINITE AUTOMATA | THEORY OF AUTOMATA & FORMAL LANGUAGES | LECTURE 01 MS. VIBHA SRIVASTAVA | AKGEC

Ground Energy estimation of Quantum Impurity model is in BQP

Gap Amplification for Local Hamiltonians with Combinatorial Soundness

Yang Wang: On regular copying languages

Classical algorithms for quantum Gibbs states

Two classical oracle separations between QMA and QCMA

Fault-Tolerance Against Adversarial Errors & PCPs

École d'été | 10 juin 2026: Applications of SAT Solvers par Joao Marques-Silva

Summer School | 10 June 2026: Applications of SAT Solvers by Joao Marques-Silva

École d'été | 10 juin 2026 : Bridging Theory and Practice with SAT and MaxSAT par Ruben Martins

Summer School | June 10, 2026: Bridging Theory and Practice with SAT and MaxSAT by Ruben Martins

École d'été | 10 juin 2026 : Boolean Is Not Too Restrictive par Pouya Shati

Summer School | June 10, 2026: Boolean Is Not Too Restrictive by Pouya Shati

How Hard is too Hard? An Introduction to Complexity - Colva Roney-Dougal