Add to ORKGIn this note, we show the existence of sets of real numbers that can be decided in polynomial time for the Blum, Shub and Smale model of computation but cannot be decided in polylogarithmic parallel time using a polynomial number of processors.Postprint (published version
This paper was motivated by the following two questions which arise in the theory of complexity for ...
(eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be ...
AbstractWe consider the Blum–Shub–Smale model of computation over the reals. It was shown that the L...
AbstractIn this note, we show the existence of sets of real numbers that can be decided in polynomia...
AbstractIn this note, we show the existence of sets of real numbers that can be decided in polynomia...
AbstractWe show that in the Blum–Shub–Smale model of computation, over the p-adic numbers Qp, the cl...
Working in the Blum-Shub-Smale model of computation on the real numbers, weanswer several questions ...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
Most of the existing work in real number computation theory concentrates on complexity issues rather...
We study two quite different approaches to understanding the complexity of fundamental problems in n...
We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
AbstractThe purpose of this paper is to investigate models of computation from a realistic viewpoint...
Colloque avec actes et comité de lecture. internationale.International audienceConsidering the Blum,...
We provide several machine-independent characterizations of deterministic complexity classes in the ...
This paper was motivated by the following two questions which arise in the theory of complexity for ...
(eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be ...
AbstractWe consider the Blum–Shub–Smale model of computation over the reals. It was shown that the L...
AbstractIn this note, we show the existence of sets of real numbers that can be decided in polynomia...
AbstractIn this note, we show the existence of sets of real numbers that can be decided in polynomia...
AbstractWe show that in the Blum–Shub–Smale model of computation, over the p-adic numbers Qp, the cl...
Working in the Blum-Shub-Smale model of computation on the real numbers, weanswer several questions ...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
Most of the existing work in real number computation theory concentrates on complexity issues rather...
We study two quite different approaches to understanding the complexity of fundamental problems in n...
We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NL...
We show some problems coming from real algebra and semi-algebraic geometry to be NP-complete or coNP...
AbstractThe purpose of this paper is to investigate models of computation from a realistic viewpoint...
Colloque avec actes et comité de lecture. internationale.International audienceConsidering the Blum,...
We provide several machine-independent characterizations of deterministic complexity classes in the ...
This paper was motivated by the following two questions which arise in the theory of complexity for ...
(eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be ...
AbstractWe consider the Blum–Shub–Smale model of computation over the reals. It was shown that the L...