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.

• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
• An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms (Q5244858) (← links)
• M. Levin’s construction of absolutely normal numbers with very low discrepancy (Q5270840) (← links)
• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages (Q5275234) (← links)
• Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable (Q5288071) (← links)
• Computational unsolvability of domains of attraction of nonlinear systems (Q5322874) (← links)
• The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)
• Effective optimization with weighted automata on decomposable trees (Q5413875) (← links)
• Complexity aspects of a semi-infinite optimization problem† (Q5449018) (← links)
• Computational complexity in algebraic systems (Q5476780) (← links)
• Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
• Computability Models: Algebraic, Topological and Geometric Algorithms (Q5886546) (← links)
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918401) (← links)
• Approximating the existential theory of the reals (Q5918470) (← links)
• On the computational complexity of decision problems about multi-player Nash equilibria (Q5918702) (← links)
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
• Iteration, inequalities, and differentiability in analog computers (Q5925968) (← links)
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)
• Sparse NP-complete problems over the reals with addition (Q5941089) (← links)
• Weak arithmetics (Q5941252) (← links)
• Weak arithmetic (Q5941732) (← links)
• On weak and weighted computations over the real closure of \(\mathbb{Q}\) (Q5941734) (← links)
• The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
• The P-DNP problem for infinite Abelian groups (Q5949384) (← links)
• A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems (Q5958118) (← links)
• Calculs sur les structures de langage dénombrable (Q5958306) (← links)
• Learning algebraic structures from text (Q5958647) (← links)
• Adaptive greedy approximations (Q5961558) (← links)
• Algebraic compressed sensing (Q6042618) (← links)
• Metafinite model theory (Q6064289) (← links)
• The foundations of spectral computations via the solvability complexity index hierarchy (Q6064883) (← links)
• Analytical complexity and signal coding (Q6118408) (← links)
• The complexity of the Hausdorff distance (Q6145675) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
• Trilateration using unlabeled path or loop lengths (Q6191440) (← links)
• Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
• Beyond the Existential Theory of the Reals (Q6489317) (← links)
• Computational complexity of decision problems about Nash equilibria in win-lose multi-player games (Q6546277) (← links)
• An impossible combinatorial counting method in distance geometry (Q6558675) (← links)
• Feasible real random access machines (Q6560189) (← links)
• Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
• On the computation of geometric features of spectra of linear operators on Hilbert spaces (Q6566148) (← links)
• Welcoming the super Turing theories (Q6573925) (← links)
• Randomized functions with high round complexity (Q6581793) (← links)
• Uncomputability and physical law (Q6599287) (← links)
• Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
• Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
• Geometry of Selberg's bisectors in the symmetric space \(SL(n, \mathbb{R})/SO(n, \mathbb{R})\) (Q6641556) (← links)