Computational complexity of some enumeration problems about uniformly sparse boolean network automata

By Predrag Tosic. In Proceedings of the Second European Conference on Complex Systems (ECCS'06), European Complex Systems Society (15 pages); to appear in September. 2006.

Full Text:

Download PDF

BibTeX

@inproceedings{ECCS-06,
    author = "Tosic, Predrag",
    title = "Computational Complexity of Some Enumeration Problems
             About Uniformly Sparse Boolean Network Automata",
    booktitle = "Proceedings of the Second European Conference on
                 Complex Systems (ECCS'06), European Complex Systems
                 Society (15 pages); to appear in September",
    keywords = "complex systems",
    year = "2006",
}