|Newton Institute > Web Seminars > Programmes & Workshops > 2006 > LAA > LAAw04|
Warning: Information on this page may be out of date.
For the full list of seminars given during this programme, see:
|13 Apr 2006:||Parametrised proof complexity
|13 Apr 2006:||A complete resolution-like calculus for Maxsat
|13 Apr 2006:||The strength of multilinear proofs
|12 Apr 2006:||Connections between zero-one programming, communication complexity and proof complexity
|12 Apr 2006:||Narrow proofs may be spacious: separating space and width in resolution
|12 Apr 2006:||Using lower bounds in proof complexity
|11 Apr 2006:||Resolution by pebbling games
|11 Apr 2006:||Sporadic propositional proofs
|11 Apr 2006:||Which SAT instances are the hardest?
|11 Apr 2006:||A minimal quantified proof system for polytime reasoning
|11 Apr 2006:||The proof complexity of matrix algebra
|11 Apr 2006:||Capturing complexity classes by their reasoning power
|11 Apr 2006:||Constraint propagation as a proof system
|10 Apr 2006:||When can $S^1_2$ prove the weak pigeonhole principle?
|10 Apr 2006:||Approximate counting in bounded arithmetic
|10 Apr 2006:||$T^1_2, T^2_2$ and search problems
|10 Apr 2006:||Uniform proof complexity
|10 Apr 2006:||The complexity of proving the discrete Jordan Curve theorem and related principles
|10 Apr 2006:||On $\forall\Sigma_1^b$ sentences provable in bounded arithmetic