Sciweavers

    FSTTCS
    2009
    Springer
    137views Software Engineering» more  FSTTCS 2009»

    The Covering and Boundedness Problems for Branching Vector Addition Systems

    14 years 7 months ago
    The Covering and Boundedness Problems for Branching Vector Addition Systems
    Download  www.lsv.ens-cachan.fr
    The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
    Stéphane Demri, Marcin Jurdzinski, Oded Lac
    claim paper
    Added 26 May 2010
    Updated 26 May 2010
    Type Conference
    Year 2009
    Where FSTTCS
    Authors Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
    Comments (0)
    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.