@InProceedings{krause_et_al:DagSemProc.06111.1,
author = {Krause, Matthias and Pudl\'{a}k, Pavel and Reischuk, R\"{u}diger and van Melkebeek, Dieter},
title = {{06111 Abstracts Collection – Complexity of Boolean Functions}},
booktitle = {Complexity of Boolean Functions},
pages = {1--24},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.1},
URN = {urn:nbn:de:0030-drops-7593},
doi = {10.4230/DagSemProc.06111.1},
annote = {Keywords: Complexity of Boolean functions, Boolean circuits, binary decision diagrams, lower bound proof techniques, combinatorics of Boolean functions, communi algorithmic learning, cryptography, derandomization}
}
@InProceedings{krause_et_al:DagSemProc.06111.2,
author = {Krause, Matthias and van Melkebeek, Dieter and Pudl\'{a}k, Pavel and Reischuk, R\"{u}diger},
title = {{06111 Executive Summary – Complexity of Boolean Functions}},
booktitle = {Complexity of Boolean Functions},
pages = {1--5},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.2},
URN = {urn:nbn:de:0030-drops-8409},
doi = {10.4230/DagSemProc.06111.2},
annote = {Keywords: Boolean and quantum circuits, discrete problems, computational complexity, lower bounds, communication complexity, proof and query complexity, randomization, pseudo-randomness, derandomization, approximation, cryptography, computational learning}
}
@InProceedings{vanmelkebeek_et_al:DagSemProc.06111.3,
author = {van Melkebeek, Dieter and Pervyshev, Konstantin},
title = {{A Generic Time Hierarchy for Semantic Models With One Bit of Advice}},
booktitle = {Complexity of Boolean Functions},
pages = {1--39},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.3},
URN = {urn:nbn:de:0030-drops-6151},
doi = {10.4230/DagSemProc.06111.3},
annote = {Keywords: Time hierarchy, non-uniformity, one bit of advice, probabilistic algorithms}
}
@InProceedings{arpe_et_al:DagSemProc.06111.4,
author = {Arpe, Jan and Manthey, Bodo},
title = {{Approximability of Minimum AND-Circuits}},
booktitle = {Complexity of Boolean Functions},
pages = {1--21},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.4},
URN = {urn:nbn:de:0030-drops-6039},
doi = {10.4230/DagSemProc.06111.4},
annote = {Keywords: Optimization problems, approximability, automated circuit design}
}
@InProceedings{shparlinski:DagSemProc.06111.5,
author = {Shparlinski, Igor E.},
title = {{Bounds on the Fourier Coefficients of the Weighted Sum Function}},
booktitle = {Complexity of Boolean Functions},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.5},
URN = {urn:nbn:de:0030-drops-6171},
doi = {10.4230/DagSemProc.06111.5},
annote = {Keywords: Fourier coefficients, congruences, average sensitivity, decision tree}
}
@InProceedings{jakoby_et_al:DagSemProc.06111.6,
author = {Jakoby, Andreas and Tantau, Till},
title = {{Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space}},
booktitle = {Complexity of Boolean Functions},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.6},
URN = {urn:nbn:de:0030-drops-6185},
doi = {10.4230/DagSemProc.06111.6},
annote = {Keywords: Series-parallel graphs, shortest path, logspace}
}
@InProceedings{gomulkiewicz_et_al:DagSemProc.06111.7,
author = {Gomulkiewicz, Marcin and Kutylowski, Miroslaw and Wlaz, Pawel},
title = {{Fault Jumping Attacks against Shrinking Generator}},
booktitle = {Complexity of Boolean Functions},
pages = {1--6},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.7},
URN = {urn:nbn:de:0030-drops-6117},
doi = {10.4230/DagSemProc.06111.7},
annote = {Keywords: Pseudorandom generator, shrinking generator, fault cryptanalysis}
}
@InProceedings{jukna:DagSemProc.06111.8,
author = {Jukna, Stasys},
title = {{Graphs and Circuits: Some Further Remarks}},
booktitle = {Complexity of Boolean Functions},
pages = {1--16},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.8},
URN = {urn:nbn:de:0030-drops-6218},
doi = {10.4230/DagSemProc.06111.8},
annote = {Keywords: Graph complexity, single level conjecture, Sylvester graphs, communication complexity, ACC-circuits}
}
@InProceedings{ford_et_al:DagSemProc.06111.9,
author = {Ford, Jeff and G\'{a}l, Anna},
title = {{Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity}},
booktitle = {Complexity of Boolean Functions},
pages = {1--20},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.9},
URN = {urn:nbn:de:0030-drops-6076},
doi = {10.4230/DagSemProc.06111.9},
annote = {Keywords: Multiparty communication complexity, lower bounds}
}
@InProceedings{gal_et_al:DagSemProc.06111.10,
author = {G\'{a}l, Anna and McKenzie, Pierre and Kouck\'{y}, Michal},
title = {{Incremental branching programs}},
booktitle = {Complexity of Boolean Functions},
pages = {1--20},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.10},
URN = {urn:nbn:de:0030-drops-6230},
doi = {10.4230/DagSemProc.06111.10},
annote = {Keywords: Complexity theory, branching programs, logarithmic space, marking machines}
}
@InProceedings{viola:DagSemProc.06111.11,
author = {Viola, Emanuele},
title = {{On Probabilistic Time versus Alternating Time}},
booktitle = {Complexity of Boolean Functions},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.11},
URN = {urn:nbn:de:0030-drops-6194},
doi = {10.4230/DagSemProc.06111.11},
annote = {Keywords: Probabilistic time, alternating time, polynomial-time hierarchy, approximate majority, constant-depth circuit}
}
@InProceedings{allender_et_al:DagSemProc.06111.12,
author = {Allender, Eric and B\"{u}rgisser, Peter and Kjeldgaard-Pedersen, Johan and Miltersen, Peter Bro},
title = {{On the Complexity of Numerical Analysis}},
booktitle = {Complexity of Boolean Functions},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.12},
URN = {urn:nbn:de:0030-drops-6130},
doi = {10.4230/DagSemProc.06111.12},
annote = {Keywords: Blum-Shub-Smale Model, Euclidean Traveling Salesman Problem, Counting Hierarchy}
}
@InProceedings{balbach_et_al:DagSemProc.06111.13,
author = {Balbach, Frank J. and Zeugmann, Thomas},
title = {{On the Teachability of Randomized Learners}},
booktitle = {Complexity of Boolean Functions},
pages = {1--20},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.13},
URN = {urn:nbn:de:0030-drops-6203},
doi = {10.4230/DagSemProc.06111.13},
annote = {Keywords: Algorithmic Teaching, Complexity of teaching}
}
@InProceedings{hayashi_et_al:DagSemProc.06111.14,
author = {Hayashi, Masahito and Iwama, Kazuo and Nishimura, Harumichi and Raymond, Rudy and Yamashita, Shigeru},
title = {{Quantum Network Coding}},
booktitle = {Complexity of Boolean Functions},
pages = {1--17},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.14},
URN = {urn:nbn:de:0030-drops-6080},
doi = {10.4230/DagSemProc.06111.14},
annote = {Keywords: Network coding, quantum computation, quantum information}
}
@InProceedings{sauerhoff:DagSemProc.06111.15,
author = {Sauerhoff, Martin},
title = {{Quantum vs. Classical Read-Once Branching Programs}},
booktitle = {Complexity of Boolean Functions},
pages = {1--13},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.15},
URN = {urn:nbn:de:0030-drops-6161},
doi = {10.4230/DagSemProc.06111.15},
annote = {Keywords: Quantum branching program, randomized branching program, read-once}
}
@InProceedings{kiltz_et_al:DagSemProc.06111.16,
author = {Kiltz, Eike and Weinreb, Enav},
title = {{Secure Linear Algebra Using Linearly Recurrent Sequences}},
booktitle = {Complexity of Boolean Functions},
pages = {1--19},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.16},
URN = {urn:nbn:de:0030-drops-6101},
doi = {10.4230/DagSemProc.06111.16},
annote = {Keywords: Secure Linear Algebra, Linearly Recurrent Sequences, Wiedemann's Algorithm}
}
@InProceedings{gal_et_al:DagSemProc.06111.17,
author = {G\'{a}l, Anna and Miltersen, Peter Bro},
title = {{The Cell Probe Complexity of Succinct Data Structures}},
booktitle = {Complexity of Boolean Functions},
pages = {1--13},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.17},
URN = {urn:nbn:de:0030-drops-6065},
doi = {10.4230/DagSemProc.06111.17},
annote = {Keywords: Cell probe model, data structures, lower bounds, time-space tradeoffs}
}
@InProceedings{carlet:DagSemProc.06111.18,
author = {Carlet, Claude},
title = {{The complexity of Boolean functions from cryptographic viewpoint}},
booktitle = {Complexity of Boolean Functions},
pages = {1--15},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.18},
URN = {urn:nbn:de:0030-drops-6044},
doi = {10.4230/DagSemProc.06111.18},
annote = {Keywords: Boolean function, nonlinearity, Reed-Muller code}
}
@InProceedings{andreev:DagSemProc.06111.19,
author = {Andreev, Alexander E.},
title = {{The optimal sequence compression}},
booktitle = {Complexity of Boolean Functions},
pages = {1--11},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.19},
URN = {urn:nbn:de:0030-drops-6025},
doi = {10.4230/DagSemProc.06111.19},
annote = {Keywords: Compression, partial boolean function}
}
@InProceedings{diehl_et_al:DagSemProc.06111.20,
author = {Diehl, Scott and van Melkebeek, Dieter},
title = {{Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines}},
booktitle = {Complexity of Boolean Functions},
pages = {1--33},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.20},
URN = {urn:nbn:de:0030-drops-6054},
doi = {10.4230/DagSemProc.06111.20},
annote = {Keywords: Time-space lower bounds, lower bounds, randomness, polynomial-time hierarchy}
}
@InProceedings{jakoby_et_al:DagSemProc.06111.21,
author = {Jakoby, Andreas and Liskiewicz, Maciej and Madry, Aleksander},
title = {{Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment}},
booktitle = {Complexity of Boolean Functions},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.21},
URN = {urn:nbn:de:0030-drops-6223},
doi = {10.4230/DagSemProc.06111.21},
annote = {Keywords: Two-Party Computations, Quantum Protocols, Bit Commitment, Oblivious Transfer.}
}
@InProceedings{andreev_et_al:DagSemProc.06111.22,
author = {Andreev, Alexander E. and Jukna, Stasys},
title = {{Very Large Cliques are Easy to Detect}},
booktitle = {Complexity of Boolean Functions},
pages = {1--7},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.22},
URN = {urn:nbn:de:0030-drops-6092},
doi = {10.4230/DagSemProc.06111.22},
annote = {Keywords: Clique function, monotone circuits, perfect hashing}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing