Algebraic Complexity Theory (Grundlehren der mathematischen Wissenschaften)

Algebraic Complexity Theory
8 679,57 RUB

If you originally registered with a username please use that to sign in. Oxford University Press is a department of the University of Oxford.

Grundlehren der mathematischen Wissenschaften

It furthers the University's objective of excellence in research, scholarship, and education by publishing worldwide. Sign In or Create an Account. Issues About Advertising and Corporate Services. Close mobile search navigation Article navigation. Book Reviews Algebraic Complexity Theory.

Покупки по категориям

Grundlehren der mathematischen Wissenschaften. Free Preview. © Algebraic Complexity Theory. Authors: Bürgisser, Peter, Clausen, Michael. Peter Bürgisser (Author), Michael Clausen (Author), Mohammad A. Shokrollahi (Author), T. Lickteig (Assistant) & 1 more. Ships from and sold by domaine-solitude.com In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become.

Article PDF first page preview. You do not currently have access to this article.

Menu de navegação

You could not be signed in. Sign In Forgot password? Don't have an account?

Border rank, complexity of matrix multiplication, secant varieties Received by editor s: August 23, Published electronically: September 26, Article copyright: Bini, Border rank of a tensor and the optimal approximation of a pair of bilinear forms , Automata, languages and programming Proc. Dario Bini, Tensor and border rank of certain classes of matrices and the fast evaluation of determinant inverse matrix and eigenvalues , Calcolo 22 , no.

With the collaboration of Thomas Lickteig. MR , https: Griesser, A lower bound for the border rank of a bilinear map , Calcolo 23 , no. Landsberg , Cartan for beginners: Landsberg and Laurent Manivel , Construction and classification of complex simple Lie algebras via projective geometry , Selecta Math.

Editorial Reviews

There was a problem filtering reviews right now. Condition - The Geometry of Numerical Algorithms. Counting Complexity Classes for Numeric Computations. Don't have an account? Computational Complexity 15 3:

Thomas Lehmkuhl and Thomas Lickteig , On the order of approximation in approximative triadic decompositions of tensors , Theoret. Thomas Lickteig, A note on border rank , Inform. Strassen, Rank and optimal computation of generic tensors , Linear Algebra Appl.