skip to content
 

Seminars (SASW01)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Event When Speaker Title Presentation Material
SASW01 26th March 2012
09:30 to 10:30
Complexity of computations and proofs and pseudo-finite structures
SASW01 26th March 2012
11:00 to 11:30
N Galesi Proof Complexity of Paris-Harrington Tautologies
SASW01 26th March 2012
11:30 to 12:30
S Kreutzer Logical Methods in the Complexity Analysis of Graph Algorithms
SASW01 26th March 2012
14:00 to 15:00
S Dantchev Parameterised Proof Complexity
SASW01 26th March 2012
15:00 to 15:30
Parameterized Complexity of DPLL Search Procedures
SASW01 26th March 2012
16:00 to 16:30
Model Checking for Modal Intuitionistic Dependence Logic
SASW01 26th March 2012
16:30 to 17:30
Complexity results for dependence logic
SASW01 27th March 2012
09:00 to 10:00
A Atserias Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs
SASW01 27th March 2012
10:00 to 10:30
The hierarchy of equivalence relations on the natural numbers under computable reducibility
SASW01 27th March 2012
11:00 to 11:30
Ordinal Strength of Logic-Enriched Type Theories
SASW01 27th March 2012
11:30 to 12:30
S Kreutzer Logical Methods in the Complexity Analysis of Graph Algorithms II
SASW01 27th March 2012
14:00 to 15:00
The complexity of enumeration and counting for acyclic conjunctive queries
SASW01 27th March 2012
15:00 to 15:30
Bounded degree and planar spectra
SASW01 27th March 2012
16:00 to 16:30
SAT Solving: Present and Future
SASW01 27th March 2012
16:30 to 17:00
Phase Transitions and Computational Complexity
SASW01 27th March 2012
17:30 to 18:30
A Hodges Alan Turing: the creative power of mathematics
SASW01 28th March 2012
09:00 to 10:00
R Santhanam Strong Lower Bounds for Constant-Depth Frege Imply Lower Bounds for Frege
SASW01 28th March 2012
10:00 to 10:30
Separations between propositional proof systems related to clause learning
SASW01 28th March 2012
11:00 to 11:30
Towards a New Theory of Bounded Arithmetic for PSPACE computations
SASW01 28th March 2012
11:30 to 12:30
NP search problems: Complexity and reducibilities
SASW01 29th March 2012
09:00 to 10:00
Y Chen From almost optimal algorithms to logics for complexity classes via listings and a halting problem
SASW01 29th March 2012
10:00 to 10:30
M Lauria Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi)
SASW01 29th March 2012
11:00 to 11:30
Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates
SASW01 29th March 2012
11:30 to 12:30
NP search problems: Provability and reducibilities
SASW01 29th March 2012
14:00 to 15:00
Descriptive complexity of linear algebra
SASW01 29th March 2012
15:00 to 15:30
Definability of linear equation systems over groups and rings
SASW01 29th March 2012
16:00 to 16:30
Proof complexity of circuit lower bounds
SASW01 29th March 2012
16:30 to 17:30
Developing logical theories for several NP search classes
SASW01 30th March 2012
09:00 to 10:00
Fragments of approximate counting
SASW01 30th March 2012
10:00 to 10:30
Root finding in TC^0 and open induction
SASW01 30th March 2012
11:00 to 11:30
Infinitary methods in finite model theory
SASW01 30th March 2012
11:30 to 12:30
Locality from circuit lower bounds
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons