pdf-format: |
|
@InProceedings{miltersen_et_al:DSP:2008:1779, author = {Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, title = {08381 Abstracts Collection -- Computational Complexity of Discrete Problems}, booktitle = {Computational Complexity of Discrete Problems }, year = {2008}, editor = {Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, number = {08381}, series = {Dagstuhl Seminar Proceedings}, ISSN = {1862-4405}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1779}, annote = {Keywords: Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, } }
Keywords: | Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, | |
Freie Schlagwörter (englisch): | computational learning, communication complexity, query complexity, hardness of approximation | |
Seminar: | 08381 - Computational Complexity of Discrete Problems | |
Issue date: | 2008 | |
Date of publication: | 2008 |