Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

57

JC
2008

favoriteEmaildiscussreport

43views more JC 2008»

On the probabilistic complexity of finding an approximate solution for linear programming

14 years 10 months ago

On the probabilistic complexity of finding an approximate solution for linear programming

Download www.optimization-online.org

Jun Ji, Florian A. Potra

Real-time Traffic

JC 2008 |

claim paper

Related Content

» Approximate Solution Techniques for Factored FirstOrder MDPs

» Multiresolution Approximation of Polygonal Curves in Linear Complexity

» A Scheme for Approximating Probabilistic Inference

» Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory

» On Complexity of Optimal Recombination for Binary Representations of Solutions

» Linear Program Approximations for Factored ContinuousState Markov Decision Processes

» A Reduced Complexity Algorithm for Minimizing NDetect Tests

» Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distri...

» Linear Programming Relaxations and Belief Propagation An Empirical Study

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JC
Authors	Jun Ji, Florian A. Potra

Comments (0)