- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Durand, A.; Haak, A.; Kontinen, J.; Vollmer, H.: Descriptive complexity of #AC0 functions. In: Leibniz International Proceedings in Informatics, LIPIcs 62 (2016). DOI: https://doi.org/10.4230/LIPIcs.CSL.2016.20
- Event
-
Veröffentlichung
- (where)
-
Hannover, Hannover
- (who)
-
Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
- (when)
-
2016
- Creator
-
Durand, Arnaud
Haak, Anselm
Kontinen, Juha
Vollmer, Heribert
- DOI
-
10.15488/1948
- URN
-
urn:nbn:de:101:1-2020082611093948608953
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:48 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Durand, Arnaud
- Haak, Anselm
- Kontinen, Juha
- Vollmer, Heribert
- Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
Time of origin
- 2016
Other Objects (12)
Descriptive complexity
Descriptive complexity of learning
The complexity of Boolean functions
The complexity of partition functions
Complexity theory of real functions
Descriptive complexity of circuit-based counting classes
Complexity of Boolean functions : 10.03. - 14.03.97
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Topological complexity of smooth random functions
Functions in complexity theory
Complexity-restricted advice functions
Small dynamic complexity classes : an investigation into dynamic descriptive complexity
Descriptive complexity
Descriptive complexity of learning
The complexity of Boolean functions
The complexity of partition functions
Complexity theory of real functions
Descriptive complexity of circuit-based counting classes
Complexity of Boolean functions : 10.03. - 14.03.97
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Topological complexity of smooth random functions
Functions in complexity theory
Complexity-restricted advice functions
Small dynamic complexity classes : an investigation into dynamic descriptive complexity
Descriptive complexity
Descriptive complexity of learning
The complexity of Boolean functions
The complexity of partition functions
Complexity theory of real functions
Descriptive complexity of circuit-based counting classes
Complexity of Boolean functions : 10.03. - 14.03.97
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Topological complexity of smooth random functions
Functions in complexity theory
Complexity-restricted advice functions