Two P-Complete Problems in the Theory of the Reals


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)
DOI: 10.1007/3-540-54233-7_163


Figures and Tables

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

Slides referencing similar topics