Pages that link to "Item:Q2817655"
From MaRDI portal
The following pages link to Lower bounds for parallel linear programming and other problems (Q2817655):
Displaying 6 items.
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Linear FPT reductions and computational lower bounds (Q3580971) (← links)
- (Q3820021) (← links)
- (Q4875177) (← links)