• search hit 137 of 141
Back to Result List

Real number models : on the use of information

  • When comparing complexity theory over the ring Z (Turing machine) on one hand and over the ring R (Blum-Shub-Smale machine) on the other hand, it will be important to study how methods and ideas of the first can be transformed to the second one. In this sense the present paper is concerned with the relation between a characterization of the P = NP?-question for the Z-case (given by Krentel) and a special class of quadratic-programming problems which are important in the real model.

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author: Klaus MeerGND
URL:http://www.sciencedirect.com/science/article/pii/S0747717184710443
DOI:https://doi.org/10.1006/jsco.1994.1044
ISSN:0747-7171
Title of the source (English):Journal of Symbolic Computation
Document Type:Scientific journal article peer-reviewed
Language:English
Year of publication:1994
Volume/Year:18
Issue number:3
First Page:199
Last Page:206
Faculty/Chair:Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Theoretische Informatik
Einverstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.