pdf-format: |
|
@InProceedings{durand_et_al:LIPIcs:2016:6560, author = {Arnaud Durand and Anselm Haak and Juha Kontinen and Heribert Vollmer}, title = {{Descriptive Complexity of #AC^0 Functions}}, booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-022-4}, ISSN = {1868-8969}, year = {2016}, volume = {62}, editor = {Jean-Marc Talbot and Laurent Regnier}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6560}, URN = {urn:nbn:de:0030-drops-65601}, doi = {10.4230/LIPIcs.CSL.2016.20}, annote = {Keywords: finite model theory, Fagin's theorem, arithmetic circuits, counting classes, Skolem function} }
Keywords: | finite model theory, Fagin's theorem, arithmetic circuits, counting classes, Skolem function | |
Seminar: | 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) | |
Issue date: | 2016 | |
Date of publication: | 29.08.2016 |