A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks (Q5223786)
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: A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks |
scientific article; zbMATH DE number 7082499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks |
scientific article; zbMATH DE number 7082499 |
Statements
A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks (English)
0 references
18 July 2019
0 references
