Sciweavers

    234 search results - page 11 / 47
    » On the relative complexity of approximate counting problems
    Sort
    View
    DLT
    2007
    80views Theoretical Computer Science» more  DLT 2007»
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    13 years 9 months ago
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
    Download  www.informatik.uni-giessen.de
    Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
    Hermann Gruber, Markus Holzer
    claim paper
    Read More »
    APPROX
    2009
    Springer
    112views Algorithms» more  APPROX 2009»
    Deterministic Approximation Algorithms for the Nearest Codeword Problem
    14 years 2 months ago
    Deterministic Approximation Algorithms for the Nearest Codeword Problem
    Download  research.microsoft.com
    The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
    Noga Alon, Rina Panigrahy, Sergey Yekhanin
    claim paper
    Read More »
    LATIN
    2004
    Springer
    191views Information Technology» more  LATIN 2004»
    Approximating the Expressive Power of Logics in Finite Models
    14 years 25 days ago
    Approximating the Expressive Power of Logics in Finite Models
    Download  gargoyle.arcadia.edu
    Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
    Argimiro Arratia, Carlos E. Ortiz
    claim paper
    Read More »
    ICDT
    2009
    ACM
    166views Database» more  ICDT 2009»
    A compositional framework for complex queries over uncertain data
    14 years 8 months ago
    A compositional framework for complex queries over uncertain data
    Download  www.cs.cornell.edu
    The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
    Christoph Koch, Michaela Götz
    claim paper
    Read More »
    IJFCS
    2006
    70views more  IJFCS 2006»
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
    13 years 7 months ago
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
    Download  theinf1.informatik.uni-jena.de
    We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
    Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
    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.