Logical Approaches to Barriers in Complexity II
Bounded degree and planar spectra (Kopczynski, E / Uniwersytet Warszawski)  의 1 번째 Windows Media 동영상입니다.
Complexity of computations and proofs and pseudo-finite structures (Krajicek, J / Charles University, Prague)  의 1 번째 Windows Media 동영상입니다.
Complexity results for dependence logic (Kontinen, J / University of Helsinki)  의 1 번째 Windows Media 동영상입니다.
Definability of linear equation systems over groups and rings (Pakusa, W / RWTH Aachen University)  의 1 번째 Windows Media 동영상입니다.
Descriptive complexity of linear algebra (Holm, B / University of Cambridge)  의 1 번째 Windows Media 동영상입니다.
Developing logical theories for several NP search classes (Nguyen, PT / Université de Montréal)  의 1 번째 Windows Media 동영상입니다.
Fragments of approximate counting (Thapen, N / Academy of Sciences of the Czech Republic)  의 1 번째 Windows Media 동영상입니다.
From almost optimal algorithms to logics for complexity classes via listings and a halting problem (Chen, Y / Shanghai Jiao Tong University)  의 1 번째 Windows Media 동영상입니다.
Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs (Atserias, A / Universitat Politècnica de Catalunya)  의 1 번째 Windows Media 동영상입니다.
Infinitary methods in finite model theory (Lindell, S / Haverford College)  의 1 번째 Windows Media 동영상입니다.
Locality from circuit lower bounds (Schweikardt, N / Goethe-Universität Frankfurt)  의 1 번째 Windows Media 동영상입니다.
Logical Methods in the Complexity Analysis of Graph Algorithms (Kreutzer, S / Technische Universität Berlin)  의 1 번째 Windows Media 동영상입니다.
Logical Methods in the Complexity Analysis of Graph Algorithms II (Kreutzer, S / Technische Universität Berlin)  의 1 번째 Windows Media 동영상입니다.
Model Checking for Modal Intuitionistic Dependence Logic (Yang, F / University of Helsinki)  의 1 번째 Windows Media 동영상입니다.
NP search problems: Complexity and reducibilities (Buss, S / University of California, San Diego)  의 1 번째 Windows Media 동영상입니다.
NP search problems: Provability and reducibilities (Buss, S / University of California, San Diego)  의 1 번째 Windows Media 동영상입니다.
Ordinal Strength of Logic-Enriched Type Theories (Adams, R / University of London)  의 1 번째 Windows Media 동영상입니다.
Parameterised Proof Complexity (Dantchev, S / Durham University)  의 1 번째 Windows Media 동영상입니다.
Parameterized Complexity of DPLL Search Procedures (Beyerdorff, O / Università degli Studi di Roma La Sapienza)  의 1 번째 Windows Media 동영상입니다.
Phase Transitions and Computational Complexity (Vardi, M / Rice University)  의 1 번째 Windows Media 동영상입니다.
Proof complexity of circuit lower bounds (Pich, J)  의 1 번째 Windows Media 동영상입니다.
Root finding in TC^0 and open induction (Jerábek, E / Academy of Sciences of the Czech Republic)  의 1 번째 Windows Media 동영상입니다.
SAT Solving: Present and Future (Kullmann, O / Swansea University)  의 1 번째 Windows Media 동영상입니다.
Separations between propositional proof systems related to clause learning (Johannsen, J / Ludwig-Maximilians-Universität München)  의 1 번째 Windows Media 동영상입니다.
Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi) (Lauria, M / Academy of Sciences of the Czech Republic)  의 1 번째 Windows Media 동영상입니다.
Strong Lower Bounds for Constant-Depth Frege Imply Lower Bounds for Frege (Santhanam, R / University of Edinburgh)  의 1 번째 Windows Media 동영상입니다.
The complexity of enumeration and counting for acyclic conjunctive queries (Durand, A / Université Denis Diderot)  의 1 번째 Windows Media 동영상입니다.
The hierarchy of equivalence relations on the natural numbers under computable reducibility (Hamkins, JD / City University of New York)  의 1 번째 Windows Media 동영상입니다.
Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates (Kolodziejczyk, L / Uniwersytet Warszawski)  의 1 번째 Windows Media 동영상입니다.
Towards a New Theory of Bounded Arithmetic for PSPACE computations (Eguchi, N / Tohoku University)  의 1 번째 Windows Media 동영상입니다.
Back to top of page