Sciweavers

    IANDC
    2006
    83views more  IANDC 2006»
    Implicit complexity over an arbitrary structure: Quantifier alternations
    13 years 11 months ago
    Implicit complexity over an arbitrary structure: Quantifier alternations
    Download  www.lix.polytechnique.fr
    We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
    Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
    claim paper
    Read More »
    IFIP
    2004
    Springer
    107views Programming Languages» more  IFIP 2004»
    Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
    14 years 4 months ago
    Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
    Download  www-lipn.univ-paris13.fr
    We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
    Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
    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.