A Weak Version of the Blum, Shub, and Sm
β
Pascal Koiran
π
Article
π
1997
π
Elsevier Science
π
English
β 646 KB
We propose a weak version of the Blum Shub Smale model of computation over the real numbers. In this weak model only a ``moderate'' usage of multiplications and divisions is allowed. The class of boolean languages recognizable in polynomial time is shown to be the complexity class PΓpoly. The main t