Computer Science – Computational Complexity
Scientific paper
2007-03-12
Computer Science
Computational Complexity
34 pages, 4 figures
Scientific paper
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.) to motivate researchers to work on these questions, and (iii.) to point out relations with more general problems in geometry. The key geometric objects for our study are the secant varieties of Segre varieties. We explain how these varieties are also useful for algebraic statistics, the study of phylogenetic invariants, and quantum computing.
No associations
LandOfFree
Geometry and the complexity of matrix multiplication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Geometry and the complexity of matrix multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometry and the complexity of matrix multiplication will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-438770