Deterministic and Probabilistic Binary Search in Graphs.
STOC'16 PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING（2016）
Key words
Noisy Binary Search,Searching in Metric Spaces,Exponential Time Hypothesis,PSPACE-hardness,Quasipolynomial-Time Algorithms
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined