Tight Space Complexity of the Coin Problem-Reference-Cited by-同舟云学术

Tight Space Complexity of the Coin Problem

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Braverman Mark¹,Garg Sumegha²,Zamir Or³

Affiliation:

1. Princeton University

2. Harvard University

3. Institute for Advanced Study

Funder

NSF

Publisher

IEEE

Link

Reference26 articles.

1. Two sides of the coin problem;cohen;Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques,2014

3. Pseudorandomness for read-once, constant-depth circuits;chen;ArXiv Preprint,2015

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Information Complexity Measure for Multi-pass Streaming with Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Depth- Threshold Circuits vs. Depth-(+1) AND-OR Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Optimal Explicit Small-Depth Formulas for the Coin Problem;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Near-Optimal Derandomization of Medium-Width Branching Programs;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02