Math 2.0

Areas Theory of computation Topic

Algebraic complexity theory

Summary

This topic is a part of theory of computation. It covers the cost of computing polynomials and bilinear maps by arithmetic operations, with arithmetic circuits, Valiant's classes VP and VNP, lower bounds, matrix multiplication, and complexity over the real numbers.

About this page
Tag4MRZ7YW9AJ
URIm2://4MRZ7YW9AJ
Kindtopic
WritingW0 stub
MSC68Q06, 68Q17, 03D15
Part ofTheory of computation
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.