The following pages link to (Q3484351):
Displaying 9 items.
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- Almost-all results on the \(p^\lambda\) problem (Q812811) (← links)
- Approximating the minimum-cost maximum flow is P-complete (Q1198087) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- On the Average Case Complexity of Some P-complete Problems (Q4256141) (← links)
- A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations (Q5215456) (← links)
- On Unapproximable Versions of $NP$-Complete Problems (Q5691296) (← links)
- Parallel approximation of optimization problems (Q6560202) (← links)