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.
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Finiteness results for abelian tree models (Q2344494) (← links)
- Iterative universal rigidity (Q2351022) (← links)
- Convex generalized flows (Q2352786) (← links)
- Generalized finite automata over real and complex numbers (Q2354406) (← links)
- The PCP theorem for NP over the reals (Q2355329) (← links)
- Constructibility of the universal wave function (Q2360329) (← links)
- Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
- An algebraic proof of the real number PCP theorem (Q2396715) (← links)
- On the complexity of Anosov saddle transitions (Q2402418) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- A note on parallel and alternating time (Q2465291) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- Interval-valued computations and their connection with PSPACE (Q2482463) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- Exact real arithmetic using centred intervals and bounded error terms (Q2577477) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Turing meets Schanuel (Q2630828) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- Quantifier elimination theory and maps which preserve semipositivity (Q2687228) (← links)
- Execution trace sets for real computation (Q2699944) (← links)
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000 (Q2732529) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- The Legacy of Turing in Numerical Analysis (Q2891357) (← links)
- Inflating balls is NP-hard (Q2893458) (← links)
- Discrete transfinite computation models (Q2906573) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- Borel-Piecewise Continuous Reducibility for Uniformization Problems (Q2974788) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- Almost Transparent Short Proofs for NPℝ (Q3088268) (← links)
- On the Kolmogorov Complexity of Continuous Real Functions (Q3091443) (← links)
- Undecidability in <b>R</b><sup><i>n</i></sup>: Riddled Basins, the KAM Tori, and the Stability of the Solar System (Q3093489) (← links)
- Parts of quantum states (Q3102464) (← links)
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata (Q3186474) (← links)
- Axiomatizing Analog Algorithms (Q3188259) (← links)
- Ordered Rings Over Which Output Sets are Recursively Enumerable Sets (Q3203015) (← links)
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
- Exact Image Reconstruction from a Single Projection through Real Computation (Q3439189) (← links)
- SAFE RECURSIVE SET FUNCTIONS (Q3450802) (← links)
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations (Q3520053) (← links)
- Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289) (← links)
