Sciweavers

    LCC
    1994
    214views Algorithms» more  LCC 1994»
    Preservation Theorems in Finite Model Theory
    13 years 9 months ago
    Preservation Theorems in Finite Model Theory
    Download  www.cl.cam.ac.uk
    Eric Rosen, Scott Weinstein
    claim paper
    Read More »
    LCC
    1994
    213views Algorithms» more  LCC 1994»
    Linear Constraint Query Languages: Expressive Power and Complexity
    13 years 9 months ago
    Linear Constraint Query Languages: Expressive Power and Complexity
    Download  www.cs.ucsb.edu
    We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
    Stéphane Grumbach, Jianwen Su, Christophe T...
    claim paper
    Read More »
    LCC
    1994
    248views Algorithms» more  LCC 1994»
    Comparing the Power of Monadic NP Games
    13 years 9 months ago
    Comparing the Power of Monadic NP Games
    Download  www.almaden.ibm.com
    The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
    Ronald Fagin
    claim paper
    Read More »
    LCC
    1994
    193views Algorithms» more  LCC 1994»
    Expressing Computational Complexity in Constructive Type Theory
    13 years 9 months ago
    Expressing Computational Complexity in Constructive Type Theory
    Download  ce.sharif.edu
    Robert L. Constable
    claim paper
    Read More »
    LCC
    1994
    209views Algorithms» more  LCC 1994»
    On Herbrand's Theorem
    13 years 9 months ago
    On Herbrand's Theorem
    Download  math.ucsd.edu
    We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
    Samuel R. Buss
    claim paper
    Read More »
    LCC
    1994
    200views Algorithms» more  LCC 1994»
    Program Extraction from Classical Proofs
    13 years 9 months ago
    Program Extraction from Classical Proofs
    Download  www.brics.dk
    We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
    Ulrich Berger, Helmut Schwichtenberg
    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.