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 9 items.
- 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)
- Sets with small generalized Kolmogorov complexity (Q1821559) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← 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)
