Pages that link to "Item:Q1171056"
From MaRDI portal
The following pages link to Computational complexity of real functions (Q1171056):
Displaying 50 items.
- On parallel complexity of analytic functions (Q388112) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Curves that must be retraced (Q550254) (← links)
- A polynomial-time computable curve whose interior has a nonrecursive measure (Q673102) (← links)
- Reducibilities on real numbers (Q795039) (← links)
- Real functions, contraction mappings, and P-completeness (Q811127) (← links)
- The Hausdorff-Ershov hierarchy in Euclidean spaces (Q818930) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- The computational complexity of maximization and integration (Q1057267) (← links)
- Theory of representations (Q1073022) (← links)
- Continuous optimization problems and a polynomial hierarchy of real functions (Q1086557) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- On the continued fraction representation of computable real numbers (Q1096627) (← links)
- Computing power series in polynomial time (Q1102956) (← links)
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664) (← links)
- The maximum value problem and NP real numbers (Q1161742) (← links)
- On the complexity of online computations of real functions (Q1186506) (← links)
- On the computational complexity of integral equations (Q1207544) (← links)
- Relatively recursive reals and real functions (Q1274809) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- Some properties of sets tractable under every polynomial-time computable distribution (Q1350351) (← links)
- Grzegorczyk's hierarchy of computable analysis (Q1575655) (← links)
- Polynomial time samplable distributions (Q1578504) (← links)
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. (Q1607286) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Effective metric spaces and representations of the reals. (Q1607294) (← links)
- Real functions computable by finite automata using affine representations. (Q1607295) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Uniformity of quantum circuit families for error-free algorithms (Q1770403) (← links)
- Computability on computable metric spaces (Q1802069) (← links)
- Complexity of the calculus of continued fraction representation of real numbers (Q1814099) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Computable preference and utility (Q1961959) (← links)
- On the time complexity of partial real functions (Q1977153) (← links)
- Computable metrics above the standard real metric (Q2033336) (← links)
- Computational complexity of classical solutions of partial differential equations (Q2104279) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
- On continuous one-way functions (Q2220825) (← links)
- Type 2 computational complexity of functions on Cantor's space (Q2277260) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- On subrecursive complexity of integration (Q2291373) (← links)
