Learning a Hidden Graph Using O(log n) Queries Per Edge

Learning Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27819-1_15 ◽

2004 ◽

pp. 210-223 ◽

Author(s):

Dana Angluin ◽

Jiang Chen

Download Full-text