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
| Tag | 4MRZ7YW9AJ |
|---|---|
| URI | m2://4MRZ7YW9AJ |
| Kind | topic |
| Writing | W0 stub |
| MSC | 68Q06, 68Q17, 03D15 |
| Part of | Theory of computation |
| Changed | 17 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.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.