Steklov Institute St. Petersburg
Technische Universität München
State University St. Petersburg
Joint Advanced Student School (JASS)
Course 1: Proofs and Computers
St. Petersburg - Sunday, April 2 through
Wednesday
, April 12, 2006
Participants:
Name:
Bernhard Haeupler
Topic:
Introduction to Complexity Theory
Name:
Felix Weninger
Topic:
Randomness and Non-Uniformity
Name:
Anton Bankevich
Topic:
Hierarchy Theorems
Name:
Ilya Posov
Topic:
Valiant-Vazirani Lemma
Name:
Dmitry Antipov
Topic:
Toda's Theorem, Part I
Name:
Dmitry Shiryaev
Topic:
Toda's Theorem, Part II
Name:
Florian Zuleger
Topic:
Interactive Proofs
Name:
Johannes Mittmann
Topic:
IP=PSPACE
Name:
Dmitry Itsykson
Topic:
#P. Complexity of the Permanent. An interactive Proof for P^{#P}
Name:
Konstantin Ushakov
Topic:
Circuit Complexity
Name:
Lukas Bulwahn
Topic:
Probabilistically Checkable Proofs
Name:
Bernhard Vesenmayer
Topic:
PCP Theorem by Gap Amplification
Name:
Dr. Edward Hirsch
Teaching Assistant
Name:
Dmytro Chibisov
Teaching Assistant
Name:
Prof. Dr. Ernst W. Mayr
Course Director
School Director
Name:
Prof. Dr. Yuri Matiyasevich
Course Director
School Director
B. Haeupler:
"Introduction to Complexity Theory"
Slides [PDF]
Paper [PDF]
F. Weninger:
"Randomness and Non-Uniformity"
Slides [PDF]
Paper [PDF]
A. Bankevich:
"Hierarchy Theorems"
Slides [PDF]
Paper [PDF]
I. Posov:
"Valiant-Vazirani Lemma"
Slides [PDF]
Paper [PDF]
D. Antipov:
"Toda's Theorem, Part I"
Slides [PDF]
Paper [PDF]
D. Shiryaev:
"Toda's Theorem, Part II"
Slides [PDF]
Paper [PDF]
F. Zuleger:
"Interactive Proofs"
Slides [PDF]
Paper [PDF]
J. Mittmann:
"IP=PSPACE"
Slides [PDF]
Paper [PDF]
D. Itsykson: "
#P. Complexity of the Permanent. An interactive Proof for P^{#P}
"
Slides [PDF]
Paper [PDF]
K. Ushakov:
"Circuit Complexity"
Slides [PDF]
Paper [PDF]
L. Bulwahn:
"Probabilistically Checkable Proofs"
Slides [PDF]
Paper [PDF]
B. Vesenmayer:
"PCP Theorem by Gap Amplification"
Slides [PDF]
Paper [PDF]