Learning a hidden graph using \(O(\log n)\)queries per edge (Q927873)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5285948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning a hidden graph using \(O(\log n)\)queries per edge |
scientific article; zbMATH DE number 5285948 |
Statements
Learning a hidden graph using \(O(\log n)\)queries per edge (English)
0 references
10 June 2008
0 references
query learning
0 references
edge-detecting queries
0 references
graphs
0 references
hypergraphs
0 references
monotone DNF formulas
0 references
chemical reaction networks
0 references
0 references
0 references
0 references
0.86438555
0 references
0.8533579
0 references
0.8533579
0 references
