Pages that link to "Item:Q4729768"

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.

• Computability of Analytic Functions with Analytic Machines (Q3576057) (← links)
• Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381) (← links)
• Some basic information on information-based complexity theory (Q3992023) (← links)
• Perspectives on information-based complexity (Q3992024) (← links)
• Algorithmic Procedures (Q4018437) (← links)
• 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
• Stabilité polynômiale des corps différentiels (Q4262586) (← links)
• Machines Over the Reals and Non-Uniformity (Q4336697) (← links)
• Fractal geometry, Turing machines and divide-and-conquer recurrences (Q4366726) (← links)
• Nonlinear phenomena in spaces of algorithms (Q4467341) (← links)
• Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation (Q4488251) (← links)
• Quantum Computation over Continuous Variables (Q4492663) (← links)
• Coupled map lattices as computational systems (Q4526242) (← links)
• Overview of coupled map lattices (Q4526244) (← links)
• Qualification Conditions in Semialgebraic Programming (Q4571881) (← links)
• Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
• Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
• On the computational power of probabilistic and faulty neural networks (Q4632413) (← links)
• Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets (Q4635358) (← links)
• Algorithms: From Al-Khwarizmi to Turing and Beyond (Q4637216) (← links)
• Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
• Colourful linear programming (Q4645909) (← links)
• Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)
• On digital nondeterminism (Q4717055) (← links)
• The cost of computing integers (Q4875601) (← links)
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
• On sparseness and Turing reducibility over the reals (Q4916198) (← links)
• Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
• Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
• On Relativizations of the P =? NP Question for Several Structures (Q4918006) (← links)
• Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
• Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
• SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS (Q4923293) (← links)
• A discreteness algorithm for 4-punctured sphere groups (Q4965259) (← links)
• Rethinking arithmetic for deep neural networks (Q4993501) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• Fast online multiplication of real numbers (Q5047161) (← links)
• Logics which capture complexity classes over the reals (Q5055931) (← links)
• On maps which preserve semipositivity and quantifier elimination theory for real numbers (Q5065095) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• (Q5089213) (← links)
• Theory of computation over stream algebras, and its applications (Q5096820) (← links)
• On NC-real complexity classes for additive circuits and their relations with NC (Q5096867) (← links)
• (Q5104106) (← links)
• Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
• Physical Computational Complexity and First-order Logic (Q5158662) (← links)
• Recognizing Visibility Graphs of Triangulated Irregular Networks (Q5164862) (← links)
• A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
• Feferman on Computability (Q5214780) (← links)
• Primitive recursion in the abstract (Q5220181) (← links)