Frobenius's Degree Formula and Toda's Polynomials

Authors:
J. -Y. Cai
Affiliations:
Department of Computer Science, SUNY at Buffalo, Buffalo, NY 14260, USA cai@cs.buffalo.edu, USA
Venue:
Theory of Computing Systems
Year:
1998

Citing 6
Cited 0

NP is as easy as detecting unique solutions

Theoretical Computer Science
On ACC

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Matching is as easy as matrix inversion

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Concrete Math

Concrete Math
On the computational power of PP and (+)P

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
ON ACC and threshold circuits

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss a connection between the degree formula of Frobenius in group representation theory and a family of polynomials used by Toda in his proof of the containment PH⊆P#P. The connection gives us a construction and proof of a generalized family of Toda polynomials.