Learning a hidden graph using \(O(\log n)\)queries per edge
type: Item
instance of: scholarly article
title: Learning a hidden graph using \(O(\log n)\)queries per edge
zbMATH Open document ID: 1147.68033
author: Dana Angluin
author: Jiang Chen
published in: Journal of Computer and System Sciences
publication date: 2008-06-10T00:00:00Z
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5285948
zbMATH Keywords: query learning
zbMATH Keywords: edge-detecting queries
zbMATH Keywords: graphs
zbMATH Keywords: hypergraphs
zbMATH Keywords: monotone DNF formulas
zbMATH Keywords: chemical reaction networks
MaRDI profile type: Publication
full work available at URL: j.jcss.2007.06.006
OpenAlex ID: W2080318337
cites work: Queries and concept learning
cites work: Automata, Languages and Programming
cites work: Learning a Hidden Matching
cites work: Learning Theory
cites work: Q3174038
cites work: Probability Inequalities for Sums of Bounded Random Variables
DOI: 10.1016/J.JCSS.2007.06.006
Recommended article: Learning Theory
Recommended article: Q3174038
Recommended article: Learning a hidden graph
Recommended article: Learning a Hidden Subgraph
Recommended article: Automata, Languages and Programming
Recommended article: Learning a hidden uniform hypergraph
Recommended article: Near-Linear Query Complexity for Graph Inference
Recommended article: Non-adaptive learning of a hidden hypergraph
Recommended article: Non-adaptive Learning of a Hidden Hypergraph
description: scientific article; zbMATH DE number 5285948