On computational complexity of graph inference from counting (Q269786)
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 computational complexity of graph inference from counting |
scientific article; zbMATH DE number 6563807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computational complexity of graph inference from counting |
scientific article; zbMATH DE number 6563807 |
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
0.7157215476036072
0 references
0.7092300653457642
0 references
0.69034343957901
0 references
0.6888644099235535
0 references
