Pages that link to "Item:Q1057267"
From MaRDI portal
The following pages link to The computational complexity of maximization and integration (Q1057267):
Displaying 19 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)
- A polynomial-time computable curve whose interior has a nonrecursive measure (Q673102) (← links)
- Real functions, contraction mappings, and P-completeness (Q811127) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- On some natural complete operators (Q1064780) (← 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)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- Computing power series in polynomial time (Q1102956) (← links)
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
- On the computational complexity of integral equations (Q1207544) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- On subrecursive complexity of integration (Q2291373) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- Complexity of Operators on Compact Sets (Q4918033) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
