Pages that link to "Item:Q1161742"
From MaRDI portal
The following pages link to The maximum value problem and NP real numbers (Q1161742):
Displaying 13 items.
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Reducibilities on real numbers (Q795039) (← links)
- On self-reducibility and weak P-selectivity (Q1054475) (← links)
- The computational complexity of maximization and integration (Q1057267) (← 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)
- Computing power series in polynomial time (Q1102956) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Analytical properties of resource-bounded real functionals (Q2509953) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- On the definitions of some complexity classes of real numbers (Q3310597) (← links)
