Sciweavers

    ISAAC
    1995
    Springer
    135views Algorithms» more  ISAAC 1995»
    The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
    13 years 8 months ago
    The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
    Download  www.daimi.au.dk
    Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
    Lars Arge
    claim paper
    Read More »
    ISAAC
    1993
    Springer
    149views Algorithms» more  ISAAC 1993»
    The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
    13 years 8 months ago
    The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
    Download  www.brl.ntt.co.jp
    A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
    Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
    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.