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.
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers (Q256428) (← links)
- A seven-dimensional family of simple harmonic functions (Q268097) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Complexity and dimension (Q287068) (← links)
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- Hardy is (almost) everywhere: nonlocality without inequalities for almost all entangled multipartite states (Q320194) (← links)
- On rational functions of first-class complexity (Q327094) (← links)
- Discrete Morse theory for computing cellular sheaf cohomology (Q330097) (← links)
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets (Q340423) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Interpolation in Valiant's theory (Q451113) (← links)
- A complex analogue of Toda's theorem (Q454132) (← links)
- A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations (Q483298) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- Neural networks with quadratic VC dimension (Q676433) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
- Representation theorems for analytic machines and computability of analytic functions (Q693052) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
- On the ultimate complexity of factorials (Q703565) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- The complexity of tensor rank (Q722207) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- Information-based complexity: New questions for mathematicians (Q751814) (← links)
- Problems of combinatorial optimization, statistical sums, and representations of the full linear group (Q806676) (← links)
- Cellular automata and discrete neural networks (Q807039) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Three concepts of decidability for general subsets of uncountable spaces (Q817852) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Simulation of simultaneous safe recursion over an arbitrary structure (Q845681) (← links)
- On invariance of degree for certain computations (Q876819) (← links)
- On the complexity of \(p\)-adic basic semi-algebraic sets (Q883331) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- The Turing degrees for some computation model with the real parameter (Q930625) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- Combinatorics for computing relativistic several complex variable domains (Q967959) (← links)
