Guest Column: New ways of studying the BPP = P conjecture-Reference-Cited by-同舟云学术

Guest Column: New ways of studying the BPP = P conjecture

Published:2023-06-13 Issue:2 Volume:54 Page:44-69
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Chen Lijie¹,Tell Roei²

Affiliation:

1. Miller Institute for Basic Research in Science at University of California, Berkeley, CA, USA

2. Institute for Advanced Study and DIMACS, Princeton, NJ, USA

Abstract

What's new in the world of derandomization? Questions about pseudorandomness and derandomization have been driving progress in complexity theory for many decades. In this survey we will describe new approaches to the BPP = P conjecture from recent years, as well as new questions, algorithmic approaches, and ways of thinking. For example: Do we really need pseudorandom generators for derandomization, or can we get away with weaker objects? Can we prove free lunch theorems, eliminating randomness with zero computational overhead? What hardness assumptions are necessary and sufficient for derandomization? And how do new advances in this area interact with progress in cryptography and in interactive proof systems?

Publisher

Association for Computing Machinery (ACM)

Subject

General Materials Science

Link

https://dl.acm.org/doi/pdf/10.1145/3604943.3604950

Reference80 articles.

1. Computational Complexity

2. [AGV09] Adi Akavia , Shafi Goldwasser , and Vinod Vaikuntanathan . Simultaneous hardcore bits and cryptography against memory attacks . In Theory of cryptography , volume 5444 , pages 474 -- 495 . 2009 . [AGV09] Adi Akavia, Shafi Goldwasser, and Vinod Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In Theory of cryptography, volume 5444, pages 474--495. 2009.

3. PRIMES is in P

4. [AMS99] Noga Alon , Yossi Matias , and Mario Szegedy . The space complexity of approximating the frequency moments. volume 58, pages 137--147. 1999 . Twenty-eighth Annual ACM Symposium on the Theory of Computing ( Philadelphia, PA , 1996 ). [AMS99] Noga Alon, Yossi Matias, and Mario Szegedy. The space complexity of approximating the frequency moments. volume 58, pages 137--147. 1999. Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996).

5. [Bar02] Boaz Barak . A probabilistic-time hierarchy theorem for "slightly non-uniform" algorithms . In Proc. 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM) , volume 2483 , pages 194 -- 208 . 2002 . [Bar02] Boaz Barak. A probabilistic-time hierarchy theorem for "slightly non-uniform" algorithms. In Proc. 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), volume 2483, pages 194--208. 2002.

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

1. Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10