A classical subject in computational complexity is what is usually called algebraic complexity. This area deals with the complexity of algorithms that take their inputs on R " , where R is a ring, understood as the number of ring operations the algorithm performs as a function of IZ, and the main kind of results are both upper and lower bounds. A recent… (More)

- Polynomial
- Algorithm
- Numerical analysis
- Parallel algorithm
- Computability
- Parallel computing
- NP (complexity)
- Computational complexity theory
- Church–Turing thesis
- P-complete
- Computability theory
- Time complexity
- Polylogarithmic function
- P versus NP problem
- Circuit complexity
- L (complexity)
- Blum Blum Shub
- F-algebra
- Mycoplasma genitalium
- Turing
- Von Neumann architecture
- Blum axioms

Sorry, we couldn't extract any figures or tables for this paper.