# Toda's theorem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2017

Review

2017

- IEEE Journal of Selected Topics in Signal…
- 2017

Concerns regarding the vulnerability of automatic speaker verification (ASV) technology against spoofing can undermine confidence… (More)

Is this relevant?

2009

2009

- SOFSEM
- 2009

We prove Toda's Theorem in the context of structural communication complexity, i.e. PH ⊆ BP · ⊕P ⊆ P(#P) = P(PP). The class… (More)

Is this relevant?

2009

2009

- Theory of Computing
- 2009

Toda in his celebrated paper showed that the polynomial-time hierarchy is contained in P#P. We give a short and simple proof of… (More)

Is this relevant?

2009

2009

- FOCS
- 2009

We study the relationship between the computational hardness of two well-studied problems in algorithmic semi-algebraic geometry… (More)

Is this relevant?

2009

2009

- Electronic Colloquium on Computational Complexity
- 2009

Toda [19] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of… (More)

Is this relevant?

2004

2004

- 2004

We consider ramified coverings of P1 with arbitrary ramification type over 0,∞ ∈ P1 and simple ramifications elsewhere and prove… (More)

Is this relevant?

2003

2003

- 2003

A cross between two well-known integrable multi-particle dynamics, an affine Toda molecule and a Sutherland system, is introduced… (More)

Is this relevant?

1997

1997

- 1997

Multidimensional cosmological model describing the evolution of (n + 1) Einstein spaces in the theory with several scalar fields… (More)

Is this relevant?

1994

1994

- 1994

Toda's theorem states that the polynomial time hierarchy is contained in P(PP) An important building block in the proof is the… (More)

Is this relevant?

1993

1993

- 1993

Abstract Affine Toda theories with imaginary couplings associate with any simple Lie algebra g generalisations of Sine Gordon… (More)

Is this relevant?