Dagstuhl Seminar Proceedings: Complexity of Boolean Functions 2006
Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek (Eds.): Complexity of Boolean Functions, 12.03. - 17.03.2006. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 Dagstuhl Seminar Proceedings 06111- Alexander E. Andreev: The optimal sequence compression.
- Scott Diehl, Dieter van Melkebeek: Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines.
- Claude Carlet: The complexity of Boolean functions from cryptographic viewpoint.
- Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Quantum Network Coding.
- Marcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wlaz: Fault Jumping Attacks against Shrinking Generator.
- Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis.
- Dieter van Melkebeek, Konstantin Pervyshev: A Generic Time Hierarchy for Semantic Models With One Bit of Advice.
- Martin Sauerhoff: Quantum vs. Classical Read-Once Branching Programs.
- Igor Shparlinski: Bounds on the Fourier Coefficients of the Weighted Sum Function.
- Andreas Jakoby, Till Tantau: Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.
- Emanuele Viola: On Probabilistic Time versus Alternating Time.
- Stasys Jukna: Graphs and Circuits: Some Further Remarks.
- Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
- Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek: 06111 Abstracts Collection -- Complexity of Boolean Functions.
- Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk: 06111 Executive Summary -- Complexity of Boolean Functions.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team