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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of pure and applied logic Ročník 99; číslo 1; s. 1 - 49
Hlavní autori:	Chapuis, Olivier, Koiran, Pascal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.08.1999 Elsevier Masson
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!