Sciweavers

    FSTTCS
    2009
    Springer
    137views Software Engineering» more  FSTTCS 2009»
    The Covering and Boundedness Problems for Branching Vector Addition Systems
    16 years 10 days 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
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.