Formal & Physical Sciences Computing & CybersecurityENProf. Vijay Ganesh | Autoformalization of research mathematics, from mizar to bounded arithmeticProf. Vijay GaneshOctober 22, 2026 23 min★ ★ ★ ★ ☆ 4/5AutoformalizationProof SynthesisLean
Formal & Physical Sciences Computing & CybersecurityENProf. Iddo Tzameret | Meta-mathematics of algebraic complexityIddo TzameretOctober 22, 2026 41 min★ ★ ★ ★ ☆ 4/5Algebraic ComplexityProof ComplexityBounded Arithmetic
Formal & Physical Sciences MathematicsENProf. Arnold Beckmann | On Propositional Translations from Theories for Log-space ComputationProf. Arnold BeckmannOctober 22, 2026 41 min★ ★ ★ ★ ★ 5/5Bounded ArithmeticPropositional Proof SystemsLog-Space Computation
Formal & Physical Sciences Computing & CybersecurityENNoel Arteche | Automating constant-depth Frege on CNF formulas is ETH-Hard, assuming no short...Noel ArtecheOctober 22, 2026 38 min★ ★ ★ ★ ☆ 4/5Proof ComplexityAutomated Theorem ProvingComplexity Theory
Formal & Physical Sciences Computing & CybersecurityENDr. Hanlin Ren | Many proof complexity generators inside one demi-bits generatorHanlin RenOctober 22, 2026 52 min★ ★ ★ ★ ★ 5/5Proof ComplexityComputational ComplexityRange Avoidance
Formal & Physical Sciences Computing & CybersecurityENProf. Olaf Beyersdorff | Fine-grained size-cost-capacity for strong semantic QBF proof systemsProf. Olaf Beyersdorff (Friedrich-Schiller-Universität Jena)October 21, 2026 24 min★ ★ ★ ★ ☆ 4/5QBFProof ComplexityLower Bounds
Formal & Physical Sciences Computing & CybersecurityENProf. Edward Hirsch | Input-oblivious complexity classes in the second level of the Polynomial H...Prof. Edward HirschOctober 21, 2026 40 min★ ★ ★ ★ ☆ 4/5Complexity TheoryPolynomial HierarchyInput-Oblivious
Formal & Physical Sciences Computing & CybersecurityENJán Pich | Efficient AdversariesJán PichOctober 21, 2026 38 min★ ★ ★ ★ ☆ 4/5Proof ComplexityComputational ComplexityAdversaries
Formal & Physical Sciences Computing & CybersecurityENDr. Robert Robere | Provable reductions in TFNPRobert RobereOctober 21, 2026 61 min★ ★ ★ ★ ☆ 4/5Proof ComplexityTFNPImplicit Proofs
Formal & Physical Sciences MathematicsENDr. Raheleh Jalali | Formalizing the LLL algorithm in bounded arithmeticDr. Raheleh JalaliOctober 21, 2026 19 min★ ★ ★ ★ ☆ 4/5LLL AlgorithmBounded ArithmeticProof Formalization
Formal & Physical Sciences MathematicsENDr. Amirhossein Akbar Tabatabai | Affine QBF-Frege: games, strategies, and lower boundsDr. Amirhossein Akbar TabatabaiOctober 21, 2026 20 min★ ★ ★ ★ ☆ 4/5QBFProof ComplexityGame Semantics
Formal & Physical Sciences MathematicsENProf. Johann Makowsky | Extensions of Courcelle's Theorem without logicProf. Johann Makowsky (Technion - Israel Institute of Technology)October 20, 2026 15 min★ ★ ★ ★ ☆ 4/5Courcelle's TheoremMonadic Second-Order LogicHankel Matrices
Formal & Physical Sciences Computing & CybersecurityENProf. Antonina Kolokolova | Representation-independent lower boundsAntonina KolokolovaOctober 20, 2026 43 min★ ★ ★ ★ ☆ 4/5Proof ComplexityLower BoundsComplexity Theory
Formal & Physical Sciences MathematicsENDr. Neil Thapen | Quantified propositional calculi and narrow implicit proofsDr. Neil Thapen (Academy of Sciences of the Czech Republic)October 20, 2026 38 min★ ★ ★ ★ ☆ 4/5Proof ComplexityImplicit ProofsQuantified Propositional Logic
Formal & Physical Sciences Computing & CybersecurityENDr. Marco Carmosino | Constructive separations from gate eliminationDr. Marco CarmosinoOctober 20, 2026 39 min★ ★ ★ ★ ☆ 4/5Complexity TheoryCircuit Lower BoundsConstructive Separations
Formal & Physical Sciences Computing & CybersecurityENDr. Emil Jeřábek | Cauchy integral theorem in a TC^0 arithmeticDr. Emil JeřábekOctober 20, 2026 66 min★ ★ ★ ★ ☆ 4/5Bounded ArithmeticTC^0Complex Analysis
Formal & Physical Sciences Computing & CybersecurityENDr. Dmitry Itsykson | Updates on resolution over paritiesDr. Dmitry Itsykson (Ben-Gurion University)October 20, 2026 37 min★ ★ ★ ★ ☆ 4/5Proof ComplexityResolutionParity
Formal & Physical Sciences MathematicsENProf. Anupam Das | A monotone version of Cook's correspondenceAnupam DasOctober 19, 2026 39 min★ ★ ★ ★ ☆ 4/5Proof ComplexityMonotone ComputationCook's Correspondence
Formal & Physical Sciences Science — General & HistoryENJiatu Li | How to build cryptography from proof complexityJiatu Li (MIT)October 19, 2026 39 min★ ★ ★ ★ ☆ 4/5CryptographyProof ComplexitySNARKs
Formal & Physical Sciences MathematicsENDr. Susanna de Rezende | The Proof Analysis Problem for Constant-Depth FregeSusanna de RezendeOctober 19, 2026 37 min★ ★ ★ ★ ★ 5/5Proof ComplexityConstant-Depth FregeResolution
Formal & Physical Sciences MathematicsENDr. Ondřej Ježil | Ultrapowers, Boolean Valued Models and Forcing in Bounded ArithmeticDr. Ondřej JežilOctober 19, 2026 38 min★ ★ ★ ★ ☆ 4/5Bounded ArithmeticForcingModel Theory
Formal & Physical Sciences Computing & CybersecurityENProf. Or Meir | On Top-Down Lower Bound Techniques for Constant-Depth CircuitsProf. Or MeirSeptember 11, 2026 61 min★ ★ ★ ★ ☆ 4/5Complexity TheoryCircuitsLower Bounds
Formal & Physical Sciences MathematicsENProf. Iddo Tzameret | Algebraic Proof Complexity: Past, Present, and FutureProf. Iddo TzameretSeptember 11, 2026 60 min★ ★ ★ ★ ★ 5/5Algebraic Proof ComplexityIPSLower Bounds
Formal & Physical Sciences MathematicsENProf. Christian Ikenmeyer | Kronecker products and iterated matrix multiplicationChristian IkenmeyerSeptember 11, 2026 65 min★ ★ ★ ★ ☆ 4/5Complexity TheoryDeterminantPermanent
Formal & Physical Sciences Computing & CybersecurityENProf. Roei Tell | Time vs Space vs Alternations: General Plasticity for Algorithms from Hardness ...Roei TellSeptember 10, 2026 61 min★ ★ ★ ★ ☆ 4/5Complexity TheoryRange AvoidanceAlgorithmic Plasticity
Formal & Physical Sciences Computing & CybersecurityENDr. Igor Carboni Oliveira | Meta-Mathematics of Complexity TheoryDr. Igor Carboni OliveiraSeptember 10, 2026 47 min★ ★ ★ ★ ☆ 4/5Complexity TheoryBounded ArithmeticP vs NP
Formal & Physical Sciences Computing & CybersecurityENDr. Hanlin Ren | Near-Maximum Circuit Lower Bounds for Exponential Time with Merlin-Arthur QueriesDr Hanlin RenSeptember 10, 2026 57 min★ ★ ★ ★ ☆ 4/5Complexity TheoryCircuit Lower BoundsMerlin-Arthur
Formal & Physical Sciences Computing & CybersecurityENHalley Goldberg | Asymmetry and Complexity of Nondeterministic ComputationsHalley Goldberg (University of Warwick)September 8, 2026 31 min★ ★ ★ ★ ★ 5/5Kolmogorov ComplexityComputational ComplexitySymmetry of Information
Formal & Physical Sciences Computing & CybersecurityENFrontiers in complexity lower bounds [LFCW01] | Mon 7th SeptemberINI Seminar Room 1September 8, 2026 65 min★ ★ ★ ★ ☆ 4/5Complexity TheoryLower BoundsMeta-Complexity
Formal & Physical Sciences Computing & CybersecurityENDr. Zhenjian Lu | Nondeterminism in Meta-ComplexityDr. Zhenjian Lu (University of Victoria)September 8, 2026 30 min★ ★ ★ ★ ☆ 4/5Meta-ComplexityAverage-Case ComplexityKolmogorov Complexity
Formal & Physical Sciences PhysicsENProf. Nicole Yunger Halpern | Thermalization and its non-Abelian discontentsNicole Yunger HalpernSeptember 4, 2026 57 min★ ★ ★ ★ ☆ 4/5ThermalizationNon-Abelian SymmetryETH
Formal & Physical Sciences PhysicsENDr. Oliver Lunt | Emergent random matrix universality in quantum operator dynamicsDr. Oliver LuntSeptember 3, 2026 59 min★ ★ ★ ★ ☆ 4/5Random Matrix TheoryQuantum DynamicsOperator Growth
Formal & Physical Sciences MathematicsENProf. Wael Bahsoun | Decay of correlations for partially hyperbolic skew-productsProf. Wael BahsounAugust 21, 2026 40 min★ ★ ★ ★ ☆ 4/5Dynamical SystemsErgodic TheoryPartially Hyperbolic
Formal & Physical Sciences MathematicsENMaxence Phalempin | Estimating stationary measures for mean field coupled systemsMaxence PhalempinAugust 21, 2026 37 min★ ★ ★ ★ ☆ 4/5Mean FieldStationary MeasuresTransfer Operator
Formal & Physical Sciences MathematicsENDr. Catherine Drysdale | Rigged Dynamic Mode Decomposition: Data-Driven Generalized Eigenfunctio...Dr. Catherine DrysdaleAugust 21, 2026 30 min★ ★ ★ ★ ☆ 4/5Koopman OperatorDynamic Mode DecompositionSpectral Theory
Formal & Physical Sciences AI — Models & ResearchENDr. Boumediene Hamzi | When Compressibility Replaces Smoothness: Bridging Machine Learning, Dynam...Dr. Boumediene HamziAugust 21, 2026 43 min★ ★ ★ ★ ☆ 4/5Kolmogorov ComplexityKernel MethodsDynamical Systems
Formal & Physical Sciences MathematicsENProf. Zlatko Drmac | Residuals and mixed backward shadowing stability of the EDMD/KMDProf. Zlatko DrmacAugust 20, 2026 42 min★ ★ ★ ★ ☆ 4/5EDMDKoopman OperatorShadowing Theory
Formal & Physical Sciences MathematicsENDr. Paula Lorenzo Sánchez | Residual Pseudospectra Reveal a Physics-Informed Koopman Backbone for...Dr. Paula Lorenzo SánchezAugust 20, 2026 46 min★ ★ ★ ★ ☆ 4/5Koopman OperatorENSOPseudospectra
Formal & Physical Sciences MathematicsENProf. Peter Koltai | Takens meets Koopman: Linear least squares prediction of nonlinear time seriesPeter KoltaiAugust 19, 2026 46 min★ ★ ★ ★ ☆ 4/5Koopman OperatorTakens TheoremTime Series Prediction
Formal & Physical Sciences MathematicsENProf. Marco Marletta | Resonance computations: are they easy or hard?Prof. Marco MarlettaAugust 19, 2026 41 min★ ★ ★ ★ ☆ 4/5ResonancesSpectral TheoryScattering Theory
![Frontiers in complexity lower bounds [LFCW01] | Mon 7th September](https://i.ytimg.com/vi/BleMYuy7FJc/hqdefault.jpg)
