AbstractIn 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 an arbitrary number of processors
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
AbstractWe show that in the Blum–Shub–Smale model of computation, over the p-adic numbers Qp, the cl...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
In this note, we show the existence of sets of real numbers that can be decided in polynomial time f...
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...
AbstractWe prove that a sequential or parallel machine in the Blum–Shub–Smale model, which recognize...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...
This paper was motivated by the following two questions which arise in the theory of complexity for ...
AbstractThe purpose of this paper is to investigate models of computation from a realistic viewpoint...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
AbstractWe show that in the Blum–Shub–Smale model of computation, over the p-adic numbers Qp, the cl...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
In this note, we show the existence of sets of real numbers that can be decided in polynomial time f...
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...
AbstractWe prove that a sequential or parallel machine in the Blum–Shub–Smale model, which recognize...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...
This paper was motivated by the following two questions which arise in the theory of complexity for ...
AbstractThe purpose of this paper is to investigate models of computation from a realistic viewpoint...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
AbstractThe complexity of linearly constrained (nonconvex) quadratic programming is analyzed within ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
AbstractConsidering the Blum, Shub, and Smale computational model for real numbers, extended by Poiz...
AbstractWe consider linear and scalar versions of the Blum–Shub–Smale model of computation over the ...
AbstractWe show that in the Blum–Shub–Smale model of computation, over the p-adic numbers Qp, the cl...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
DOI
Add to ORKG