[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/uc/TosicA05>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Gul_A._Agha>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Predrag_T._Tosic>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F11560319%5F18>
foaf:homepage <https://doi.org/10.1007/11560319_18>
dc:identifier DBLP conf/uc/TosicA05 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F11560319%5F18 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
rdfs:label On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Gul_A._Agha>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Predrag_T._Tosic>
swrc:pages 191-205 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/uc/2005>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/uc/TosicA05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/uc/TosicA05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/uc/uc2005.html#TosicA05>
rdfs:seeAlso <https://doi.org/10.1007/11560319_18>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/uc>
dc:subject Cellular and graph automata, sequential and synchronous dynamical systems, configuration space properties, computational complexity, #P-completeness (xsd:string)
dc:title On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document