Mathematical methods in computational complexity. (Q4955548)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1453452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mathematical methods in computational complexity. |
scientific article; zbMATH DE number 1453452 |
Statements
28 May 2000
0 references
complexity classes
0 references
primality testing
0 references
probabilistic algorithms
0 references
algebraic compelxity
0 references
linear transformations
0 references
Boolean circuits
0 references
monotonic circuits
0 references
0.7986629009246826
0 references
0.7735174894332886
0 references
Mathematical methods in computational complexity. (English)
0 references
The book presents some classes of mathematical models which can be applied to the evaluation of complexity. It deals with complexity classes, primality testing, probabilistic algorithms, algebraic complexity, linear transformations, Boolean circuits, monotonic circuits and an algebraic characterization of the class \(\text{NC}^{1}\).
0 references
