Sciweavers

    9 search results - page 1 / 2
    » dimacs 2001
    Sort
    View
    DIMACS
    2001
    97views Theoretical Computer Science» more  DIMACS 2001»
    Lower Bounds and Real Algebraic Geometry
    13 years 6 months ago
    Lower Bounds and Real Algebraic Geometry
    Download  math-www.uni-paderborn.de
    Peter Bürgisser
    claim paper
    Read More »
    DIMACS
    2001
    95views Theoretical Computer Science» more  DIMACS 2001»
    On the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
    13 years 6 months ago
    On the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
    Download  www.math.purdue.edu
    The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...
    Andrei Gabrielov, Thierry Zell
    claim paper
    Read More »
    DIMACS
    2001
    106views Theoretical Computer Science» more  DIMACS 2001»
    Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
    13 years 6 months ago
    Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
    Download  www.math.uni-frankfurt.de
    We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
    Thorsten Theobald
    claim paper
    Read More »
    DIMACS
    1996
    133views Theoretical Computer Science» more  DIMACS 1996»
    On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
    13 years 6 months ago
    On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
    Download  www.labri.fr
    : We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
    Bruno Courcelle
    claim paper
    Read More »
    DIMACS
    2001
    153views Theoretical Computer Science» more  DIMACS 2001»
    Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
    13 years 6 months ago
    Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
    Download  maven.smith.edu
    Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
    Ileana Streinu
    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.