On the impact of treewidth in the computational complexity of freezing dynamics (Q2117789)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the impact of treewidth in the computational complexity of freezing dynamics |
scientific article; zbMATH DE number 7495174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the impact of treewidth in the computational complexity of freezing dynamics |
scientific article; zbMATH DE number 7495174 |
Statements
On the impact of treewidth in the computational complexity of freezing dynamics (English)
0 references
22 March 2022
0 references
freezing automata networks
0 references
treewidth
0 references
fast parallel algorithm
0 references
prediction
0 references
nilpotency
0 references
asynchronous reachability
0 references
predecessor problem
0 references
0 references
0 references
0.7739991545677185
0 references
0.7353532910346985
0 references
0.7330962419509888
0 references
0.7328404188156128
0 references
0.7231361269950867
0 references
