Sciweavers

    111 search results - page 1 / 23
    » Third-Order Computation and Bounded Arithmetic
    Sort
    View
    LOGCOM
    2007
    92views more  LOGCOM 2007»
    Third-Order Computation and Bounded Arithmetic
    13 years 7 months ago
    Third-Order Computation and Bounded Arithmetic
    Download  www.cs.toronto.edu
    Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
    Alan Skelley
    claim paper
    Read More »
    CSL
    2004
    Springer
    83views Automated Reasoning» more  CSL 2004»
    A Third-Order Bounded Arithmetic Theory for PSPACE
    14 years 25 days ago
    A Third-Order Bounded Arithmetic Theory for PSPACE
    Download  www.cs.toronto.edu
    We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
    Alan Skelley
    claim paper
    Read More »
    DAC
    2005
    ACM
    122views Computer Architecture» more  DAC 2005»
    Normalization at the arithmetic bit level
    13 years 9 months ago
    Normalization at the arithmetic bit level
    Download  www.cecs.uci.edu
    We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
    Markus Wedler, Dominik Stoffel, Wolfgang Kunz
    claim paper
    Read More »
    UMC
    2000
    208views Applied Computing» more  UMC 2000»
    Upper and Lower Bounds on Continuous-Time Computation
    13 years 11 months ago
    Upper and Lower Bounds on Continuous-Time Computation
    Download  www.santafe.edu
    Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
    Manuel Lameiras Campagnolo, Cristopher Moore
    claim paper
    Read More »
    TCS
    1998
    79views Theoretical Computer Science» more  TCS 1998»
    Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
    13 years 7 months ago
    Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
    Download  www.cs.rutgers.edu
    Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
    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.