AbstractWe show that there are algorithms which find an approximate zero of a system of polynomial equations and which function in polynomial time on the average. The number of arithmetic operations is cN4s, where N is the input size and c a universal constant
Abstract. How complex could the solution be to an initial value prob-lem given by a polynomial-time ...
AbstractThe best Chebyshev approximation of degree n to a continuous function f on [0, 1] is the uni...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given....
AbstractWe show that there are algorithms which find an approximate zero of a system of polynomial e...
On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomial
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently g...
objects encountered in analysis, such as real functions, from the viewpoints of computability and co...
The class UP of `ultimate polynomial time' problems over C is introduced; it contains the class...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
Analysis of condition number for random matrices originated in the works of von Neumann and Turing o...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
We propose to measure the efficiency of any implementation of the λ-calculus as a function of a new ...
. A worst case bound for the condition number of a generic system of polynomial equations with integ...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
In recent years a number of algorithms have been designed for the "inverse" computational ...
Abstract. How complex could the solution be to an initial value prob-lem given by a polynomial-time ...
AbstractThe best Chebyshev approximation of degree n to a continuous function f on [0, 1] is the uni...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given....
AbstractWe show that there are algorithms which find an approximate zero of a system of polynomial e...
On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomial
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently g...
objects encountered in analysis, such as real functions, from the viewpoints of computability and co...
The class UP of `ultimate polynomial time' problems over C is introduced; it contains the class...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
Analysis of condition number for random matrices originated in the works of von Neumann and Turing o...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
We propose to measure the efficiency of any implementation of the λ-calculus as a function of a new ...
. A worst case bound for the condition number of a generic system of polynomial equations with integ...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
In recent years a number of algorithms have been designed for the "inverse" computational ...
Abstract. How complex could the solution be to an initial value prob-lem given by a polynomial-time ...
AbstractThe best Chebyshev approximation of degree n to a continuous function f on [0, 1] is the uni...
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given....
DOI
Add to ORKG