AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard.

SODA '20: ACM-SIAM Symposium on Discrete Algorithms Salt Lake City Utah Janua..., pp.279-296, (2020)

Cited by: 1|Views13
EI
Get fulltext within 24h
Bibtex

Abstract

We study the complexity of approximately solving packing linear programs. In the Real RAM model, it is known how to solve packing LPs with N non-zeros in time Õ(N/ϵ). We investigate whether the ϵ dependence in the running time can be improved. Our first main result relates the difficulty of this problem to hardness assumptions for solvin...More

Code:

Data:

Author
Peng Zhang
Peng Zhang
Your rating :
0

 

Tags
Comments
小科