A complex analogue of Toda's theorem (Q454132): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0912.2652 / rank | |||
Normal rank | |||
Revision as of 13:52, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complex analogue of Toda's theorem |
scientific article |
Statements
A complex analogue of Toda's theorem (English)
0 references
1 October 2012
0 references
\textit{S. Toda}'s, theorem [SIAM J. Comput. 20, No. 5, 865--877 (1991; Zbl 0733.68034)] states that the discrete polynomial time hierarchy is contained in the class of languages of polynomial time with respect to an oracle computing a function in \(\#P\). A real analogue has been given by the author and \textit{T. Zell} [Found. Comput. Math. 10, No. 4, 429--454 (2010; Zbl 1200.14108)]. This paper contains a complex analogue.
0 references
polynomial hierarchy
0 references
Betti numbers
0 references
Poincare polynomial
0 references
constructible sets
0 references
