pdf-format: |
|
@Article{gl_et_al:DR:2019:11292, author = {Anna G{\'a}l and Rahul Santhanam and Till Tantau}, title = {{Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)}}, pages = {64--82}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {3}, editor = {Anna G{\'a}l and Rahul Santhanam and Till Tantau}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11292}, URN = {urn:nbn:de:0030-drops-112920}, doi = {10.4230/DagRep.9.3.64}, annote = {Keywords: circuit complexity, communication complexity, computational complexity, parametrisation, randomness} }
Keywords: | circuit complexity, communication complexity, computational complexity, parametrisation, randomness | |
Seminar: | Dagstuhl Reports, Volume 9, Issue 3 | |
Issue date: | 2019 | |
Date of publication: | 12.09.2019 |