Sciweavers

    JC
    2008
    43views more  JC 2008»

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

    13 years 11 months ago
    On the probabilistic complexity of finding an approximate solution for linear programming
    Download  www.optimization-online.org
    Jun Ji, Florian A. Potra
    claim paper
    Added 13 Dec 2010
    Updated 13 Dec 2010
    Type Journal
    Year 2008
    Where JC
    Authors Jun Ji, Florian A. Potra
    Comments (0)
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.