General Information
| Student: | Pavel K🍩blich Dvořák |
|---|---|
| Office: | CoRE 407 |
| School: | Computer Science Institute of Charles University in Prague |
| Adviser: | Periklis Papakonstantinou |
| Project: | Time Versus Space |
The Czech Group
I am here as a coordinator of the group of Czech students
The czech group consists of Jakub Pekárek (my right hand who helps me with benevolent ruling), Andrej Dedík, Aneta Šťastná, Jan Petr, Jan Soukup, Lukáš Ondráček, Mikhail Beliyeu, Petr Chmel, Petra Pelikánová, Radim Předstíraný and myself.
Project Description
Together with part of the Czeh group I am working working on a project with our advisor Periklis Papakonstantinou.
Progress
Week 0 & 1
- We met our mentor for the first time and he introduced us the problem.
- We read some papers about pebbling [1,2], oblivious TM [3] and inductive counting to create a circuit for a complement problem [4].
- We presented our project to other students.
- We attended a talk by Neil Sloane.
References
- John Hopcroft, Wolfgang Paul and Leslie Valiant. On Time Versus Space.
- Patrick W. Dymond and Martin Tompa. Speedups of Deterministic Machines by Synchronous Parallel Machines.
- Paul Beame. Circuit Complexity / Counting Problems (Lecture notes).
- Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo and Martin Tompa. Two Applications of Inductive Counting for Complementation Problems.