Saturation and stability in the theory of computation over the reals

This paper was motivated by the following two questions which arise in the theory of complexity for computation over ordered rings in the now famous computational model introduced by Blum, Shub and Smale: 1. (i) is the answer to the question P = ?NP the same in every real-closed field? 2. (ii) if P...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of pure and applied logic Vol. 99; no. 1; pp. 1 - 49
Main Authors:	Chapuis, Olivier, Koiran, Pascal
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.08.1999 Elsevier Masson
Subjects:	BSS model of computation Complexity Complexity over arbitrary structures Computer Science Deterministic and nondeterministic polynomial time Ladner's theorem Parallel computation Real-closed field 68Q15 Real-closed field BSS model of computation Ladner's theorem Complexity over arbitrary structures 12L12 03D15 Parallel computation 03C99 Deterministic and nondeterministic polynomial time Complexity
ISSN:	0168-0072
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!