On computational complexity of graph inference from counting (Q269786)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computational complexity of graph inference from counting |
scientific article |
Statements
On computational complexity of graph inference from counting (English)
0 references
6 April 2016
0 references
computational complexity
0 references
counting
0 references
de novo drug design
0 references
graph inference
0 references
tree-decomposition
0 references
spectrum
0 references
walk history
0 references
