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.
- Relativizations of the P=?NP question over the reals (and other ordered rings) (Q1338213) (← links)
- Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids (Q1338215) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis (Q1338218) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) (Q1338220) (← links)
- A convex geometric approach to counting the roots of a polynomial system (Q1338221) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Polynomial algorithms for linear programming over the algebraic numbers (Q1343466) (← links)
- Toward a generalized computability theory (Q1346903) (← links)
- On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
- The simple dynamics of super Turing theories (Q1349873) (← links)
- On the relations between distributive computability and the BSS model (Q1349919) (← links)
- Recursion theory on the reals and continuous-time computation (Q1349921) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- Generalized Knapsack problems and fixed degree separations (Q1351965) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- Computational complexity over the \(p\)-adic numbers (Q1368832) (← links)
- On NP-completeness for linear machines (Q1368835) (← links)
- Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
- Metafinite model theory (Q1383163) (← links)
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\) (Q1385406) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- \(\mu\)-recursion and infinite limits. (Q1401321) (← links)
- Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) (← links)
- Limits of theory sequences over algebraically closed fields and applications. (Q1421482) (← links)
- Natural computation and non-Turing models of computation (Q1434372) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- Hypercomputation by definition (Q1434375) (← links)
- Quantum automata and quantum grammars (Q1566730) (← links)
- Counting problems over the reals (Q1575534) (← links)
- Isomorphism theorem for BSS recursively enumerable sets over real closed fields (Q1575912) (← links)
- The Turing closure of an Archimedean field (Q1575915) (← links)
- Efficient \(p\)-adic cell decompositions for univariate polynomials (Q1578508) (← links)
- Mathematical problems for the next century (Q1582494) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Transfer theorems via sign conditions (Q1603522) (← links)
- Lower bounds for some decision problems over \(C\) (Q1605321) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. (Q1607286) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- An alternative to Ben-Or's lower bound for the knapsack problem complexity (Q1609452) (← links)
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality (Q1672012) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
