@inproceedings{durand_et_al:LIPIcs:2016:6560,
Address = {Dagstuhl, Germany},
Annote = {Keywords: finite model theory, Fagin's theorem, arithmetic circuits, counting classes, Skolem function},
Author = {Durand, Arnaud and Haak, Anselm and Kontinen, Juha and Vollmer, Heribert},
BookTitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
Editor = {Talbot, Jean-Marc and Regnier, Laurent},
File = {Descriptive Complexity of \#AC^0 Functions - LIPIcs-CSL-2016-20.pdf},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
Pages = {20:1--20:16},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Descriptive Complexity of $\#AC^0$ Functions}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6560},
Volume = {62},
Year = {2016},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/6560},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CSL.2016.20},
date-added = {2022-07-01 12:43:06 +0200},
date-modified = {2022-07-01 12:43:06 +0200},
urn = {urn:nbn:de:0030-drops-65601},
doi = {10.4230/LIPIcs.CSL.2016.20}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A