Sciweavers

    72
    Voted
    UC
    2005
    Springer
    114views Applied Computing» more  UC 2005»
    On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
    15 years 2 months ago
    On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
    Download  osl.cs.uiuc.edu
    Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
    Predrag T. Tosic, Gul A. Agha
    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-2025, USA.