Sciweavers

    SIAMCOMP
    2008
    86views more  SIAMCOMP 2008»
    The Complexity of Monadic Second-Order Unification
    13 years 11 months ago
    The Complexity of Monadic Second-Order Unification
    Download  www.iiia.csic.es
    Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
    Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
    claim paper
    Read More »
    SIAMCOMP
    2008
    60views more  SIAMCOMP 2008»
    Improved Approximation Algorithms for Minimum Weight Vertex Separators
    13 years 11 months ago
    Improved Approximation Algorithms for Minimum Weight Vertex Separators
    Download  research.microsoft.com
    Uriel Feige, MohammadTaghi Hajiaghayi, James R. Le...
    claim paper
    Read More »
    SIAMCOMP
    2008
    65views more  SIAMCOMP 2008»
    Exact Algorithms for Treewidth and Minimum Fill-In
    13 years 11 months ago
    Exact Algorithms for Treewidth and Minimum Fill-In
    Download  lita.sciences.univ-metz.fr
    We show that the treewidth and the minimum fill-in of an n-vertex graph can be
    Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngv...
    claim paper
    Read More »
    SIAMCOMP
    2008
    72views more  SIAMCOMP 2008»
    Query-Efficient Algorithms for Polynomial Interpolation over Composites
    13 years 11 months ago
    Query-Efficient Algorithms for Polynomial Interpolation over Composites
    Download  research.microsoft.com
    Parikshit Gopalan
    claim paper
    Read More »
    SIAMCOMP
    2008
    45views more  SIAMCOMP 2008»
    The Spectral Method for General Mixture Models
    13 years 11 months ago
    The Spectral Method for General Mixture Models
    Download  research.microsoft.com
    Ravindran Kannan, Hadi Salmasian, Santosh Vempala
    claim paper
    Read More »
    SIAMCOMP
    2008
    130views more  SIAMCOMP 2008»
    Short PCPs with Polylog Query Complexity
    13 years 11 months ago
    Short PCPs with Polylog Query Complexity
    Download  www.cs.technion.ac.il
    We give constructions of probabilistically checkable proofs (PCPs) of length n
    Eli Ben-Sasson, Madhu Sudan
    claim paper
    Read More »
    SIAMCOMP
    2008
    84views more  SIAMCOMP 2008»
    Resolution Is Not Automatizable Unless W[P] Is Tractable
    13 years 11 months ago
    Resolution Is Not Automatizable Unless W[P] Is Tractable
    Download  people.cs.uchicago.edu
    We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
    Michael Alekhnovich, Alexander A. Razborov
    claim paper
    Read More »
    SIAMCOMP
    2008
    100views more  SIAMCOMP 2008»
    On the Complexity of Verifying Consistency of XML Specifications
    13 years 11 months ago
    On the Complexity of Verifying Consistency of XML Specifications
    Download  homepages.inf.ed.ac.uk
    XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
    Marcelo Arenas, Wenfei Fan, Leonid Libkin
    claim paper
    Read More »
    SIAMCOMP
    2008
    137views more  SIAMCOMP 2008»
    Approximate Shortest Paths in Anisotropic Regions
    13 years 11 months ago
    Approximate Shortest Paths in Anisotropic Regions
    Download  www.cs.ust.hk
    Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
    Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
    claim paper
    Read More »
    SIAMCOMP
    2008
    72views more  SIAMCOMP 2008»
    Plottable Real Number Functions and the Computable Graph Theorem
    13 years 11 months ago
    Plottable Real Number Functions and the Computable Graph Theorem
    Download  www.fernuni-hagen.de
    The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
    Vasco Brattka
    claim paper
    Read More »
    « first‹ previous1234next ›last »
    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.