Add to ORKGWe briefly survey recent computational complexity results for certain algebraic problems that are relevant to numerical analysis and mathematical programming. Topics include (i) linear programming, (ii) decision methods and quantifier elim-ination methods for the first order theory of the reals, (iii) solving real algebrai
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
This series of papers presents a complete development and complexity analysis of a decision method, ...
On the Computational Complexity of Approximating Solutions for Real Algebraic Formula
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
AbstractAn attempt is made to introduce the non-expert reader to the many aspects of a relatively ne...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Abstract. We discuss issues of problem formulation for algorithms in real algebraic ge-ometry, focus...
In recent years a number of algorithms have been designed for the "inverse" computational ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...
Algebraic complexity theory, the study of the minimum number of operations suficient to perform alge...
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
This series of papers presents a complete development and complexity analysis of a decision method, ...
On the Computational Complexity of Approximating Solutions for Real Algebraic Formula
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
AbstractAn attempt is made to introduce the non-expert reader to the many aspects of a relatively ne...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Abstract. We discuss issues of problem formulation for algorithms in real algebraic ge-ometry, focus...
In recent years a number of algorithms have been designed for the "inverse" computational ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...
Algebraic complexity theory, the study of the minimum number of operations suficient to perform alge...
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
This series of papers presents a complete development and complexity analysis of a decision method, ...