pdf-format: |
|
@Article{gl_et_al:DR:2017:7361, author = {Anna G{\'a}l and Michal Kouck{\'y} and Oded Regev and Till Tantau}, title = {{Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)}}, pages = {45--69}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2017}, volume = {7}, number = {3}, editor = {Anna G{\'a}l and Michal Kouck{\'y} and Oded Regev and Till Tantau}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7361}, URN = {urn:nbn:de:0030-drops-73611}, doi = {10.4230/DagRep.7.3.45}, annote = {Keywords: Computational Complexity} }
Keywords: | Computational Complexity | |
Seminar: | Dagstuhl Reports, Volume 7, Issue 3 | |
Issue date: | 2017 | |
Date of publication: | 17.10.2017 |