Learning a Hidden Graph Using O(log N) Queries per Edge

COLT 2004 pp. 210-223

doi:10.1007/978-3-540-27819-1_15 /colt/2004/angluin2004colt-learning/

Cite

Text

Angluin and Chen. "Learning a Hidden Graph Using O(log N) Queries per Edge." Annual Conference on Computational Learning Theory, 2004. doi:10.1007/978-3-540-27819-1_15

Markdown

[Angluin and Chen. "Learning a Hidden Graph Using O(log N) Queries per Edge." Annual Conference on Computational Learning Theory, 2004.](https://mlanthology.org/colt/2004/angluin2004colt-learning/) doi:10.1007/978-3-540-27819-1_15

BibTeX

@inproceedings{angluin2004colt-learning,
  title     = {{Learning a Hidden Graph Using O(log N) Queries per Edge}},
  author    = {Angluin, Dana and Chen, Jiang},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2004},
  pages     = {210-223},
  doi       = {10.1007/978-3-540-27819-1_15},
  url       = {https://mlanthology.org/colt/2004/angluin2004colt-learning/}
}