Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > BETTI NUMBERS:
Reports tagged with Betti numbers:
TR09-140 | 18th December 2009
Saugata Basu

#### A complex analogue of Toda's Theorem

Revisions: 1

Toda \cite{Toda} proved in 1989 that the (discrete) polynomial time hierarchy,
$\mathbf{PH}$,
is contained in the class $\mathbf{P}^{\#\mathbf{P}}$,
namely the class of languages that can be
decided by a Turing machine in polynomial time given access to an
oracle with the power to compute a function in the ... more >>>

ISSN 1433-8092 | Imprint