Sciweavers

    FOCS
    1998
    IEEE
    89views Theoretical Computer Science» more  FOCS 1998»
    A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
    14 years 3 months ago
    A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
    Download  infolab.stanford.edu
    We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
    John C. Mitchell, Mark Mitchell, Andre Scedrov
    claim paper
    Read More »
    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.