A complex analogue of Toda's theorem
\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.
scientific article; zbMATH DE number 6088728
scientific article