The following pages link to (Q4002474):
Displaying 50 items.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region (Q281197) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- On parallel complexity of analytic functions (Q388112) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
- Computational complexity of iterated maps on the interval (Q449664) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Curves that must be retraced (Q550254) (← links)
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- Recursive analysis of singular ordinary differential equations (Q638473) (← links)
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- A polynomial-time computable curve whose interior has a nonrecursive measure (Q673102) (← links)
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- Computability on random events and variables in a computable probability space (Q690479) (← links)
- Representation theorems for analytic machines and computability of analytic functions (Q693052) (← links)
- Approximating the hard square entropy constant with probabilistic methods (Q693710) (← links)
- Computability in linear algebra (Q703545) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- Two algorithms in search of a type-system (Q733753) (← links)
- Three concepts of decidability for general subsets of uncountable spaces (Q817852) (← links)
- Stability versus speed in a computable algebraic model (Q817853) (← links)
- Computability of measurable sets via effective topologies (Q818928) (← links)
- The Hausdorff-Ershov hierarchy in Euclidean spaces (Q818930) (← links)
- Exact real computation of solution operators for linear analytic systems of partial differential equations (Q832000) (← links)
- Computability versus exact computability of martingales (Q834952) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- Effectively open real functions (Q864433) (← links)
- Towards computability of elliptic boundary value problems in variational formulation (Q864435) (← links)
- The basic feasible functionals in computable analysis (Q864439) (← links)
- Computing Schrödinger propagators on type-2 Turing machines (Q864440) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Are unbounded linear operators computable on the average for Gaussian measures? (Q945917) (← links)
- A characterization of the entropies of multidimensional shifts of finite type (Q974081) (← links)
- Jordan curves with polynomial inverse moduli of continuity (Q995570) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Coinduction for exact real number computation (Q1015372) (← links)
- Classification of computably approximable real numbers (Q1015380) (← links)
- A computable approach to measure and integration theory (Q1021572) (← links)
- What Monte Carlo models can do and cannot do efficiently? (Q1031571) (← links)
- Computing the uncomputable; or, the discrete charm of second-order simulacra (Q1036071) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
