The following pages link to (Q4212463):
Displaying 15 items.
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Most relevant explanation: Computational complexity and approximation methods (Q766267) (← links)
- On the complexity of approximating the Hadwiger number (Q1006087) (← links)
- On complexity of round transformations (Q1045033) (← links)
- Complexity of approximation problems (Q1962273) (← links)
- Approximation complexity of sums of random processes (Q2274403) (← links)
- The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting (Q2365845) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- A refinement of Cauchy-Schwarz complexity (Q2674565) (← links)
- On Parameterized Approximability (Q3499729) (← links)
- (Q3792916) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Complexity Approximation Principle (Q4933950) (← links)
- On Pseudodeterministic Approximation Algorithms. (Q5005164) (← links)