default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDagstuhl Seminar Proceedings: Complexity of Boolean Functions 2006
- Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 - Alexander E. Andreev:
The optimal sequence compression. - Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. - 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. - Jeff Ford, Anna Gál:
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity. - Anna Gál, Peter Bro Miltersen:
The Cell Probe Complexity of Succinct Data Structures. - Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Quantum Network Coding. - Alexander E. Andreev, Stasys Jukna:
Very Large Cliques are Easy to Detect. - Eike Kiltz, Enav Weinreb:
Secure Linear Algebra Using Linearly Recurrent Sequences. - 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 E. 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. - Frank J. Balbach, Thomas Zeugmann:
On the Teachability of Randomized Learners. - Stasys Jukna:
Graphs and Circuits: Some Further Remarks. - Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. - Anna Gál, Pierre McKenzie, Michal Koucký:
Incremental branching programs. - 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.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-25 22:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
