Sciweavers

    STOC
    2002
    ACM
    119views Algorithms» more  STOC 2002»

    The complexity of approximating entropy

    16 years 3 months ago
    The complexity of approximating entropy
    Download  www.maths.lse.ac.uk
    Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt R
    claim paper
    Added 03 Dec 2009
    Updated 03 Dec 2009
    Type Conference
    Year 2002
    Where STOC
    Authors Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
    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-2026, USA.