BN Homepage Two-Image carousal

!

Javascript is not enabled in your browser. Enabling JavaScript in your browser will allow you to experience all the features of our site.

Learn how to enable JavaScript on your browser

Lectures on the Complexity of Bilinear Problems

Lectures on the Complexity of Bilinear Problems

Add to Wishlist

Lectures on the Complexity of Bilinear Problems

Paperback(1987)

$54.99

Paperback(1987)
$54.99

SHIP THIS ITEM

In stock. Ships in 6-10 days.
PICK UP IN STORE

Your local store may have stock of this item.

Available within 2 business hours

Want it Today?
Check Store Availability

Related collections and offers

Product Details
Table of Contents

Product Details

ISBN-13:	9783540172055
Publisher:	Springer Berlin Heidelberg
Publication date:	02/23/1987
Series:	Lecture Notes in Computer Science , #245
Edition description:	1987
Pages:	140
Product dimensions:	6.10(w) x 9.25(h) x 0.01(d)

Table of Contents

Complexity and rank of bilinear mappings.- Elementary properties of rank and approximate rank of bilinear mappings.- Multiplication of large matrices.- Complexity and rank of finite dimensional associative algebras.- Algorithm varieties.

From the B&N Reads Blog

Page 1 of

Customer Reviews