Skip to search formSkip to main contentSkip to account menu

Toda's theorem

Toda's theorem is a result in computational complexity theory that was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
A novel space system architecture is proposed, which would enable 100-g-class spacecraft to be flown as swarms (100 s-1000 s) in… 
Highly Cited
2014
Highly Cited
2014
There is now a renewed interest [1]–[4] to a Hurwitz τ-function, counting the isomorphism classes of Belyi pairs, arising in the… 
Highly Cited
2013
Highly Cited
2013
A bstractIn this article we use 5-brane junctions to study the 5D TN SCFTs corresponding to the 5D $ \mathcal{N} $ = 1 uplift of… 
Highly Cited
2011
Highly Cited
2011
Terrorizing Women: Feminicide in the Americas Durham, NC and London: Duke University Press, 2010, ISBN: 978-0-8223-4681-4, 382 pp… 
Highly Cited
2005
Highly Cited
2005
For an almost simple complex algebraic group G with affine Grassmannian $\text{Gr}_G=G(\mathbb{C}(({\rm t})))/G(\mathbb{C}[[{\rm… 
Highly Cited
2004
Highly Cited
2004
A principal goal of nature farming is to produce abundant and healthy crops without the use of chemical fertilizers and… 
Highly Cited
1980
Highly Cited
1980
M. Toda, J. Phys. Soc. Jpn. 22, 431 (1967). M. Toda, Prog. Theor. Phys. Suppl. 45, 174 (1970). M. Toda, Rocky Mountain J. Math. 8…