Skip to main content

Part of the book series: Trends in Logic ((TREN,volume 23))

  • 265 Accesses

Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder-Strassen bound R(A) ≥ 2dimA − t, where t is the number of maximal twosided ideals of A. The class of algebras for which the Alder- Strassen bound is sharp, the so-called algebras of minimal rank, has received a wide attention in algebraic complexity theory. A lot of effort has been spent on describing algebras of minimal rank in terms of their algebraic structure. We review the known characterisation results, study some examples of algebras of minimal rank, and have a quick look at some central techniques. We put special emphasis on recent developments.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this paper

Cite this paper

Bläser, M. (2004). Algebras of minimal rank: overview and recent developments. In: Löwe, B., Piwinger, B., Räsch, T. (eds) Classical and New Paradigms of Computation and their Complexity Hierarchies. Trends in Logic, vol 23. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2776-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-2776-5_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-2775-8

  • Online ISBN: 978-1-4020-2776-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics