Search Results - "Numerical Algorithms and Problems—Computations on polynomials General Terms Algorithms"

Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract)

Authors: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

Contributors: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

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

Subject Terms: 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

File Description: application/pdf

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

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