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.
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Abstract geometrical computation. V: Embedding computable analysis (Q1761691) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- An optical model of computation (Q1779303) (← links)
- On sparseness, reducibilities, and complexity (Q1779309) (← links)
- Efficient exact computation of iterated maps (Q1779563) (← links)
- On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms (Q1783975) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- The calculi of emergence: Computation, dynamics and induction (Q1817022) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Integration in Real PCF (Q1854356) (← links)
- P\(\neq\) NC over the \(p\)-adic numbers (Q1869961) (← links)
- Topological complexity of zero finding with algebraic operations (Q1872637) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Learning from rounded-off data. (Q1873753) (← links)
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
- On the P-NP problem over real matrix rings (Q1884926) (← links)
- The complexity of resource allocation and price mechanisms under bounded rationality (Q1896683) (← links)
- The polynomial topological complexity of Fatou-Julia sets (Q1899297) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?'' (Q1913573) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Harmonic properties of the logarithmic potential and the computability of elliptic Fekete points (Q1939499) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Approximate zeros and condition numbers (Q1974565) (← links)
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- A universal oracle for signal machines (Q2011670) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Characterizations of ITBM-computability. I (Q2026737) (← links)
- On the complexity of fitted toral dynamics (Q2034568) (← links)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- Strong spatial mixing for repulsive point processes (Q2165287) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines (Q2243586) (← links)
- Periodic generalized automata over the reals (Q2280333) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
