Computing over the reals with addition and order
type: Item
instance of: scholarly article
title: Computing over the reals with addition and order
zbMATH Open document ID: 0822.68028
DOI: 10.1016/0304-3975(93)00063-B
author: Pascal Koiran
published in: Theoretical Computer Science
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 695891
zbMATH Keywords: complexity theory
zbMATH Keywords: additive real machines
MaRDI profile type: Publication
cites work: Q3692867
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: On digital nondeterminism
cites work: Q5592246
cites work: Q5588717
cites work: Bounds for the computational power and learning complexity of analog neural nets
cites work: A note on a \(P \neq NP\) result for a restricted class of real machines
cites work: Q4729767
cites work: Q3818127
cites work: Analog computation via neural networks
cites work: Real addition and the polynomial hierarchy
Recommended article: Computing over the reals with addition and order: Higher complexity classes
Recommended article: Q3184782
Recommended article: Computations with effective real numbers
Recommended article: Real numbers and computers
Recommended article: Real addition and the polynomial hierarchy
Recommended article: Computability of Real Numbers
Recommended article: Q4011251
Recommended article: A recursion theoretic foundation of computation over real numbers
Recommended article: Q4941884
Recommended article: Q4222971
description: scientific article; zbMATH DE number 695891