Skip to main content
SpringerLink
Log in
Book cover

Lectures on the Complexity of Bilinear Problems

  • Book
  • © 1987

Overview

Authors:
  1. Hans F. Groote
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 245)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-6

  3. Complexity and rank of bilinear mappings

    Pages 7-25

  4. Elementary properties of rank and approximate rank of bilinear mappings

    Pages 26-56

  5. Multiplication of large matrices

    Pages 57-82

  6. Complexity and rank of finite dimensional associative algebras

    Pages 83-110

  7. Algorithm varieties

    Pages 111-128

  8. Back Matter

    Download chapter PDF
Back to top

Keywords

Bibliographic Information

  • Book Title: Lectures on the Complexity of Bilinear Problems

  • Authors: Hans F. Groote

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0020719

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1987

  • Softcover ISBN: 978-3-540-17205-5Published: 01 January 1987

  • eBook ISBN: 978-3-540-47398-5Published: 23 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 140

  • Topics: Algorithm Analysis and Problem Complexity, Numerical Analysis

Publish with us

Policies and ethics

Back to top

Search

Navigation