Ask
Search
My library

About
Statistics
Contact
Data Protection
Accessibility
Imprint
Changelog
Frontend: v1.31.3
Backend: v1.11.4

We use cookies to provide a better user experience.

Data Protection

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II

Renegar, J.

Publication date

July 1989

Publisher

Cornell University Operations Research and Industrial Engineering

Abstract

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I

Extracted data

Topics

Related items

Computational complexity of real functions and real numbers

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1986

SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Kombinatorika matematických struktur

Paták, Pavel

January 2012

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Computational Complexity in Analysis and Geometry

Kawamura, Akitoshi

August 2011

Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I

Renegar, J.

July 1989

PLEASE NOTE: The original Technical Report TR00853 is missing. A copy can be found at http://www.sc...

On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination

Renegar, James

March 1992

This series of papers presents a complete development and complexity analysis of a decision method, ...

Computing over the Reals with Addition and Order: Higher Complexity Classes

Cucker, F.
Koiran, P.

September 1995

AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...

Computing over the Reals with Addition and Order: Higher Complexity Classes

Cucker, F.
Koiran, P.

September 1995

AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...

Computational Complexity of Solving Real Algebraic Formulae

James Renegar

January 1991

We briefly survey recent computational complexity results for certain algebraic problems that are re...

On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination

Renegar, James

March 1992

This series of papers presents a complete development and complexity analysis of a decision method, ...

Some aspects of complexity in real algebraic geometry

Risler, Jean-Jacques

April 1988

This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...

The Information Content

Saugata Basu

January 1975

Abstract. We survey both old and new developments in the theory of al-gorithms in real algebraic geo...

Computing over the Reals: Where Turing meets Newton

Lenore Blum

January 2004

The classical (Turing) theory of computation has been extraordinarily successful in providing the fo...

Kombinatorika matematických struktur

Paták, Pavel

January 2010

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Kombinatorika matematických struktur

Paták, Pavel

January 2010

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Kombinatorika matematických struktur

Paták, Pavel

January 2012

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Computational complexity of real functions and real numbers

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1986

SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Kombinatorika matematických struktur

Paták, Pavel

January 2012

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Computational Complexity in Analysis and Geometry

Kawamura, Akitoshi

August 2011

Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...

On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I

Renegar, J.

July 1989

PLEASE NOTE: The original Technical Report TR00853 is missing. A copy can be found at http://www.sc...

On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination

Renegar, James

March 1992

This series of papers presents a complete development and complexity analysis of a decision method, ...

Computing over the Reals with Addition and Order: Higher Complexity Classes

Cucker, F.
Koiran, P.

September 1995

AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...

Computing over the Reals with Addition and Order: Higher Complexity Classes

Cucker, F.
Koiran, P.

September 1995

AbstractThis paper deals with issues of structural complexity in a linear version of the Blum-Shub-S...

Computational Complexity of Solving Real Algebraic Formulae

James Renegar

January 1991

We briefly survey recent computational complexity results for certain algebraic problems that are re...

On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination

Renegar, James

March 1992

This series of papers presents a complete development and complexity analysis of a decision method, ...

Some aspects of complexity in real algebraic geometry

Risler, Jean-Jacques

April 1988

This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...

The Information Content

Saugata Basu

January 1975

Abstract. We survey both old and new developments in the theory of al-gorithms in real algebraic geo...

Computing over the Reals: Where Turing meets Newton

Lenore Blum

January 2004

The classical (Turing) theory of computation has been extraordinarily successful in providing the fo...

Kombinatorika matematických struktur

Paták, Pavel

January 2010

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Kombinatorika matematických struktur

Paták, Pavel

January 2010

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Kombinatorika matematických struktur

Paták, Pavel

January 2012

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Computational complexity of real functions and real numbers

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1986

SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Kombinatorika matematických struktur

Paták, Pavel

January 2012

The combinatorics of a first order mathematical structure is the class of all formulas valid in all ...

Computational Complexity in Analysis and Geometry

Kawamura, Akitoshi

August 2011

Computable analysis studies problems involving real numbers, sets and functions from the viewpoint o...