Pages that link to "Item:Q1086557"
From MaRDI portal
The following pages link to Continuous optimization problems and a polynomial hierarchy of real functions (Q1086557):
Displaying 18 items.
- Real functions, contraction mappings, and P-completeness (Q811127) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- On the complexity of ranking (Q920620) (← links)
- On sparse oracles separating feasible complexity classes (Q1111385) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Polynomial-time hierarchies on some classes of functions. I (Q1337389) (← links)
- Sets with small generalized Kolmogorov complexity (Q1821559) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Complexity classes of optimization functions (Q1898460) (← links)
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Reducibilities on tally and sparse sets (Q3357534) (← links)
- Two logical hierarchies of optimization problems over the real numbers (Q3376539) (← links)
- Unconstrained Optimization of Real Functions in Complex Variables (Q4899016) (← links)
- The operators min and max on the polynomial hierarchy (Q5047162) (← links)
- On the complexity of small description and related topics (Q5096821) (← links)
- Degrees and reducibilities of easy tally sets (Q5096899) (← links)
