Loading [MathJax]/jax/input/TeX/config.js

Descriptive complexity of #P functions: A new perspective

Research output: Contribution to journal › Article › Research › peer review

Authors

Arnaud Durand
Anselm Haak
Juha Aleksi Kontinen
Heribert Vollmer

Research Organisations

Institute of Theoretical Computer Science

External Research Organisations

Universite Paris 7
University of Helsinki

1 - 1 out of 1Page size: 10

10
20
40
80
160

Select page size:

Sort by: Start date

Sort by:

Order:

Asc.

Desc.

Projects

Arithmetic versus Boolean Complexity: The Case of Small-Depth Circuits
Vollmer, H. (Principal Investigator)
1 Nov 2015 → 1 Jan 2019
Project: Research