Sciweavers

    17541 search results - page 50 / 3509
    » Complexity in scalable computing
    Sort
    View
    JC
    2007
    130views more  JC 2007»
    On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
    14 years 9 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 »
    STOC
    2012
    ACM
    221views Algorithms» more  STOC 2012»
    From query complexity to computational complexity
    13 years 4 days 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 »
    VLDB
    2005
    ACM
    132views Database» more  VLDB 2005»
    Hash-based labeling techniques for storage scaling
    15 years 10 months ago
    Hash-based labeling techniques for storage scaling
    Download  infolab.usc.edu
    Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
    Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
    claim paper
    Read More »
    FOCM
    2007
    76views more  FOCM 2007»
    The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
    14 years 9 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 »
    JCSS
    2011
    95views more  JCSS 2011»
    The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
    14 years 4 months ago
    The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
    Download  www.cs.rutgers.edu
    Eric Allender, Michal Koucký, Detlef Ronneb...
    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-2025, USA.