Pages that link to "Item:Q4729768"
From MaRDI portal
The following pages link to On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768):
Displaying 50 items.
- Combinatorics for computing relativistic several complex variable domains (Q967959) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- A hierarchy below the halting problem for additive machines (Q1015375) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- VPSPACE and a transfer theorem over the complex field (Q1034531) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Computability of a map and decidability of its graph in the model of Blum, Shub and Smale (Q1127553) (← links)
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Universal resolution for NP-complete problems (Q1129008) (← links)
- Complexity of functions: Some questions, conjectures, and results (Q1174450) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- The parallel complexity of function approximation (Q1179031) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- Parallel information-based complexity (Q1186504) (← links)
- Statistical complexity of dominant eigenvector calculation (Q1186505) (← links)
- Turing computability with neural nets (Q1190653) (← links)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) (Q1201156) (← links)
- A problem that is easier to solve on the unit-cost algebraic RAM (Q1203641) (← links)
- A note on a \(P \neq NP\) result for a restricted class of real machines (Q1203647) (← links)
- Two \(P\)-complete problems in the theory of the reals (Q1203649) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- \(\delta\)-uniform BSS machines (Q1271171) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
- A domain-theoretic approach to computability on the real line (Q1274807) (← links)
- Feasible real random access machines (Q1279912) (← links)
- Equality is a jump (Q1292397) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Analytic machines (Q1292402) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- On the cost of uniform and nonuniform algorithms (Q1292410) (← links)
- Concrete models of computation for topological algebras (Q1292413) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- On the computability of fractal dimensions and Hausdorff measure (Q1295381) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- Real number models under various sets of operations (Q1311387) (← links)
- Mysteries of mathematics and computation (Q1323030) (← links)
- Analog computation via neural networks (Q1331940) (← links)
- Computability with low-dimensional dynamical systems (Q1334658) (← links)
- Formulation of linear problems and solution by a universal machine (Q1338141) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
