1 research outputs found
Feasible arithmetic computations: Valiant's hypothesis
An account of Valiant's theory of p-computable versus p-definable polynomials, an arithmetic analogue of the Boolean theory of P versus NP, is presented, with detailed proofs of Valiant's central results