Pages that link to "Item:Q750289"
From MaRDI portal
The following pages link to Approximating linear programming is log-space complete for P (Q750289):
Displaying 13 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- A note on approximate linear programming (Q1198023) (← links)
- Approximating the minimum-cost maximum flow is P-complete (Q1198087) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- On the Average Case Complexity of Some P-complete Problems (Q4256141) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
