The following pages link to Complexity and Approximation (Q3297819):
Displaying 15 items.
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
- Promise Problems on Probability Distributions (Q3297824) (← links)
- On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets (Q3297825) (← links)
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation (Q3297826) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
- Sequential Location Game on Continuous Directional Star Networks (Q3297829) (← links)
- Core Decomposition, Maintenance and Applications (Q3297830) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- A Note on the Position Value for Hypergraph Communication Situations (Q3297833) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
