Sciweavers

    13603 search results - page 1 / 2721
    » On the Computational Complexity of Cut-Reduction
    Sort
    View
    LICS
    2008
    IEEE
    98views Automated Reasoning» more  LICS 2008»
    On the Computational Complexity of Cut-Reduction
    15 years 7 months ago
    On the Computational Complexity of Cut-Reduction
    Download  www.linta.de
    Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
    Klaus Aehlig, Arnold Beckmann
    claim paper
    Read More »
    79
    Voted
    COMPLEXITY
    2006
    87views more  COMPLEXITY 2006»
    Complexity, parallel computation and statistical physics
    15 years 1 months ago
    Complexity, parallel computation and statistical physics
    Download  people.umass.edu
    Jonathan Machta
    claim paper
    Read More »
    111
    Voted
    JC
    2007
    130views more  JC 2007»
    On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
    15 years 1 months ago
    On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
    Download  math-www.uni-paderborn.de
    We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
    Peter Scheiblechner
    claim paper
    Read More »
    152
    Voted
    STOC
    2012
    ACM
    221views Algorithms» more  STOC 2012»
    From query complexity to computational complexity
    13 years 3 months ago
    From query complexity to computational complexity
    Download  theory.stanford.edu
    We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
    Shahar Dobzinski, Jan Vondrák
    claim paper
    Read More »
    105
    Voted
    FOCM
    2007
    76views more  FOCM 2007»
    The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
    15 years 1 months ago
    The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
    Download  math-www.uni-paderborn.de
    Peter Bürgisser, Martin Lotz
    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-2026, USA.