☆
3.8
Proceedings Paper
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2018)
导出引文
没有可用的引文
评价这篇论文
主要评分表示论文的整体质量水平。次要评分独立反映论文的优点或缺点。
Become a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get StartedAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started