Výsledky vyhledávání - "Numerical Algorithms AND Problems—Computations on polynomials General Terms Algorithms"

Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract)

Autoři: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

Zdroj: http://math-www.upb.de/agpb/work/arxiv1210.8368v1.pdf.

Témata: Measures andClasses, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials General Terms Algorithms, Theory Keywords geometric complexitytheory, tensorrank, matrixmultiplication, Kronecker coefficients, permanent versus determinant

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.779

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.779
http://math-www.upb.de/agpb/work/arxiv1210.8368v1.pdf

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p

Témata: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

Reviews & Products: COMMUNICATIONS of the ACM (Periodical)

Testing Nilpotence of Galois Groups in Polynomial Time.

Autoři: Arvind, V. Kurur, Piyush P.

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 3, p1-22, 22p

Témata: NILPOTENT groups, GALOIS theory, POLYNOMIALS, ALGORITHMS, SYLOW subgroups, UNIVARIATE analysis