Abstract
Existing proofs that deduce BPP = P from circuit lower bounds convert randomized algorithms into deterministic algorithms with a large polynomial slowdown. We convert randomized algorithms into deterministic ones with little slowdown. Specifically, assuming exponential lower bounds against randomized NP ∩ coNP circuits, formally known as randomized SVN circuits, we convert any randomized algorithm over inputs of length n running in time t ≥ n into a deterministic one running in time t2+α for an arbitrarily small constant α > 0. Such a slowdown is nearly optimal for t close to n, since under standard complexity-theoretic assumptions, there are problems with an inherent quadratic derandomization slowdown. We also convert any randomized algorithm that errs rarely into a deterministic algorithm having a similar running time (with pre-processing). The latter derandomization result holds under weaker assumptions, of exponential lower bounds against deterministic SVN circuits.
Our results follow from a new, nearly optimal, explicit pseudorandom generator fooling circuits of size s with seed length (1+α)log s, under the assumption that there exists a function f ∈ E that requires randomized SVN circuits of size at least 2(1-α′)n, where α = O(α)′. The construction uses, among other ideas, a new connection between pseudoentropy generators and locally list recoverable codes.
- [1] . 1978. Two theorems on random polynomial time. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS’78). IEEE, 75–83.Google Scholar
Digital Library
- [2] . 1992. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theor. 38, 2 (1992), 509–516.Google Scholar
Digital Library
- [3] . 1995. Linear time erasure codes with nearly optimal recovery. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS’95). IEEE, 512–519.Google Scholar
Cross Ref
- [4] . 1992. Simple constructions of almost k-wise independent random variables. Rand. Struct. Algor. 3, 3 (1992), 289–304.Google Scholar
Cross Ref
- [5] . 2016. Incompressible functions, relative-error extractors, and the power of nondeterministic reductions. Computat. Complex. 25, 2 (2016), 349–418.Google Scholar
Digital Library
- [6] . 1998. Reconstructing algebraic functions from mixed data. SIAM J. Comput. 28, 2 (1998), 487–510.Google Scholar
Digital Library
- [7] . 2016. Pseudorandomness when the odds are against you. In Proceedings of the 31st Annual Conference on Computational Complexity (CCC’16). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.Google Scholar
Digital Library
- [8] . 2017. Pseudorandom generators with optimal seed length for non-boolean poly-size circuits. ACM Trans. Computat. Theor. 9, 2 (2017), 6.Google Scholar
Digital Library
- [9] . 1997. On resource-bounded measure and pseudorandomness. In Proceedings of the International Conference on Foundations of Software Technology and Theoretical Computer Science. Springer, 235–249.Google Scholar
Cross Ref
- [10] . 2007. Derandomization in cryptography. SIAM J. Comput. 37, 2 (2007), 380–400.Google Scholar
Cross Ref
- [11] . 2012. 2-source dispersers for \( n^{o(1)} \) entropy, and Ramsey graphs beating the Frankl-Wilson construction. Ann. Math. 176, 3 (2012), 1483–1544.Google Scholar
Cross Ref
- [12] . 2003. Computational analogues of entropy. In Approximation, Randomization, and Combinatorial Optimization—Algorithms and Techniques. Springer, 200–215.Google Scholar
- [13] . 2019. Bootstrapping results for threshold circuits “just beyond” known lower bounds. In Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC’19). ACM, 34–41.Google Scholar
Digital Library
- [14] . 2021. Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. In Proceedings of the 53rd Annual ACM Symposium on Theory of Computing (STOC’21). ACM.Google Scholar
Digital Library
- [15] . 2022. Hardness vs randomness, revised: Uniform, non-black-box, and instance-wise. In Proceedings of the IEEE 62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS’22). IEEE, 125–136.Google Scholar
Cross Ref
- [16] . 2022. When Arthur has neither random coins nor time to spare: Superfast derandomization of proof systems. In Proceedings of the Electronic Colloquium on Computational Complexity (ECCC).Google Scholar
- [17] . 2011. Memory delegation. In Proceedings of the Annual Cryptology Conference. Springer, 151–168.Google Scholar
Digital Library
- [18] . 2016. Extractors for near logarithmic min-entropy. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS’16). IEEE, 178–187.Google Scholar
Cross Ref
- [19] . 2019. List decoding with double samplers. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19). SIAM, 2134–2153.Google Scholar
Cross Ref
- [20] . 2008. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38, 1 (2008), 97–139.Google Scholar
Digital Library
- [21] . 2013. Nondeterministic direct product reductions and the success probability of SAT solvers. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). IEEE, 736–745.Google Scholar
Digital Library
- [22] . 2008. Leakage-resilient cryptography. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08). IEEE, 293–302.Google Scholar
Digital Library
- [23] . 2013. On beating the hybrid argument. Theor. Comput. 9, 26 (2013), 809–843.
DOI: Google ScholarCross Ref
- [24] . 2003. Relative expanders or weakly relatively Ramanujan graphs. Duke Math. J. 118, 1 (2003), 19–35.Google Scholar
Cross Ref
- [25] . 2015. A unified approach to deterministic encryption: New constructions and a connection to computational entropy. J. Cryptol. 28, 3 (2015), 671–717.Google Scholar
Digital Library
- [26] . 2012. Computational entropy and information leakage. IACR Cryptology ePrint Archive 2012 (2012), 466.Google Scholar
- [27] . 1981. Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22, 3 (1981), 407–420.Google Scholar
Cross Ref
- [28] . 2013. Complexity of computation in finite fields. J. Math. Sci. 191, 5 (2013), 661–685.Google Scholar
Cross Ref
- [29] . 2017. For-all sparse recovery in near-optimal time. ACM Trans. Algor. 13, 3 (2017), 1–26.Google Scholar
Digital Library
- [30] . 2013. \( \ell _2/\ell _2 \)-foreach sparse recovery with low risk. In Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP). Springer, 461–472.Google Scholar
Digital Library
- [31] . 1997. A sample of samplers: A computational perspective on sampling. In Proceedings of the Electronic Colloquium on Computational Complexity (ECCC).Google Scholar
- [32] . 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4 (
July 1998), 653–750.Google ScholarDigital Library
- [33] . 2014. On derandomizing algorithms that err extremely rarely. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC’14). ACM, 109–118.Google Scholar
Digital Library
- [34] . 1997. Tiny families of functions with random properties: A quality-size trade-off for hashing. Rand. Struct. Algor. 11, 4 (1997), 315–343.Google Scholar
Digital Library
- [35] . 2002. Derandomization that is rarely wrong from short advice that is typically good. In Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science. Springer, 209–223.Google Scholar
Cross Ref
- [36] . 2018. Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound. IEEE Trans. Inf. Theor. 64, 8 (2018), 5813–5831.Google Scholar
Digital Library
- [37] . 2018. Indistinguishability by adaptive procedures with advice, and lower bounds on hardness amplification proofs. In Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science (FOCS’18). IEEE, 956–966.Google Scholar
Cross Ref
- [38] . 2002. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC’02). ACM, 812–821.Google Scholar
Digital Library
- [39] . 2003. Linear time encodable and list decodable codes. In Proceedings of the 35th Annual Symposium on Theory of Computing (STOC’03). ACM, 126–135.Google Scholar
Digital Library
- [40] . 2003. Linear time encodable and list decodable codes. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC’03). ACM, 126–135.Google Scholar
Digital Library
- [41] . 2008. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy. IEEE Trans. Inf. Theor. 54, 1 (2008), 135–150.Google Scholar
Digital Library
- [42] . 2019. Essential coding theory. Retrieved from https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book.Google Scholar
- [43] . 2009. Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes. J. ACM 56, 4 (2009), 20.Google Scholar
Digital Library
- [44] . 2008. The complexity of local list decoding. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Springer, 455–468.Google Scholar
- [45] . 2003. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computat. Complex. 12, 3-4 (2003), 85–130.Google Scholar
Digital Library
- [46] . 2015. Parallel hashing via list recoverability. In Proceedings of the Annual Cryptology Conference. Springer, 173–190.Google Scholar
Digital Library
- [47] . 1999. A pseudorandom generator from any one-way function. SIAM J. Comput. 28, 4 (1999), 1364–1396.Google Scholar
Digital Library
- [48] . 2019. Local list recovery of high-rate tensor codes and applications. SIAM J. Comput. 49, 4 (2019), FOCS17–157–FOCS17–195.Google Scholar
Digital Library
- [49] . 2018. Linear-time list recovery of high-rate expander codes. Inf. Computat. 261 (2018), 202–218.Google Scholar
Digital Library
- [50] . 2007. Conditional computational entropy, or toward separating pseudoentropy from compressibility. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 169–186.Google Scholar
Digital Library
- [51] . 1997. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC’97). ACM, 220–229.Google Scholar
Digital Library
- [52] . 2010. Efficiently decodable non-adaptive group testing. In Proceedings of the 21st Annual Symposium on Discrete Algorithms (SODA’10). SIAM, 1126–1142.Google Scholar
Cross Ref
- [53] . 1972. Class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theor. 18, 5 (1972), 652–656.Google Scholar
Digital Library
- [54] . 2011. Fast polynomial factorization and modular composition. SIAM J. Comput. 40, 6 (2011), 1767–1802.Google Scholar
Digital Library
- [55] . 2002. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31, 5 (2002), 1501–1526.Google Scholar
Digital Library
- [56] . 2017. High-rate locally correctable and locally testable codes with sub-polynomial query complexity. J. ACM 64, 2 (2017), 11.Google Scholar
Digital Library
- [57] . 2018. Improved decoding of folded Reed-Solomon and multiplicity codes. In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS’18). IEEE, 212–223.Google Scholar
Cross Ref
- [58] . 2016. Heavy hitters via cluster-preserving clustering. In Proceedings of the 57th IEEE Annual Symposium on Foundations of Computer Science (FOCS’16). IEEE, 61–70.Google Scholar
Cross Ref
- [59] . 2005. Derandomizing Arthur–Merlin games using hitting sets. Computat. Complex. 14, 3 (2005), 256–279.Google Scholar
Digital Library
- [60] . 2019. Deterministic approximation of random walks in small space. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM’19). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 42:1–42:22.Google Scholar
- [61] . 1993. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22, 4 (1993), 838–856.Google Scholar
Digital Library
- [62] . 1994. Hardness vs randomness. J. Comput. Syst. Sci. 49, 2 (1994), 149–167.Google Scholar
Digital Library
- [63] . 1979. Relations among complexity measures. J. ACM 26, 2 (1979), 361–381.Google Scholar
Digital Library
- [64] . 2000. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discr. Math. 13, 1 (2000), 2–24.Google Scholar
Digital Library
- [65] . 2002. Extracting all the randomness and reducing the error in Trevisan’s extractors. J. Comput. Syst. Sci. 65, 1 (2002), 97–128.Google Scholar
Digital Library
- [66] . 2003. Personal Communication.Google Scholar
- [67] . 2006. Extracting randomness via repeated condensing. SIAM J. Comput. 35, 5 (2006), 1185–1209.Google Scholar
Digital Library
- [68] . 2002. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. Math. 155, 1 (2002), 157–187.Google Scholar
Cross Ref
- [69] . 2018. Average-radius list-recoverability of random linear codes. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18). SIAM, 644–662.Google Scholar
Cross Ref
- [70] . 2005. Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52, 2 (2005), 172–216.Google Scholar
Digital Library
- [71] . 2006. Pseudorandomness for approximate counting and sampling. Computat. Complex. 15, 4 (2006), 298–341.Google Scholar
Digital Library
- [72] . 2007. Low-end uniform hardness vs. randomness tradeoffs for AM. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC’07). ACM, 430–439.Google Scholar
Digital Library
- [73] . 2022. On hardness assumptions needed for “Extreme High-End” PRGs and fast derandomization. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS’22). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.Google Scholar
- [74] . 2015. Metric pseudoentropy: Characterizations, transformations and applications. In Proceedings of the International Conference on Information Theoretic Security. Springer, 105–122.Google Scholar
Cross Ref
- [75] . 2015. Condensed unpredictability. In Proceedings of the International Colloquium on Automata, Languages, and Programming. Springer, 1046–1057.Google Scholar
Cross Ref
- [76] . 1997. Decoding of Reed–Solomon codes beyond the error-correction bound. J. Complex. 13, 1 (1997), 180–193.Google Scholar
Digital Library
- [77] . 2001. Pseudorandom generators without the XOR lemma. J. Comput. Syst. Sci. 62, 2 (2001), 236–266.Google Scholar
Digital Library
- [78] . 2017. Explicit, almost optimal, epsilon-balanced codes. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC’17). ACM, 238–251.Google Scholar
Digital Library
- [79] . 2004. Extractor codes. IEEE Trans. Inf. Theor. 50, 12 (2004), 3015–3025.Google Scholar
Digital Library
- [80] . 2006. Extractors from Reed–Muller codes. J. Comput. Syst. Sci. 72 (2006), 786–812.Google Scholar
Digital Library
- [81] . 2018. Quantified derandomization of linear threshold circuits. In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC’18). ACM, 855–865.Google Scholar
Digital Library
- [82] . 2019. Improved bounds for quantified derandomization of constant-depth circuits and polynomials. Computat. Complex. 28, 2 (2019), 259–343.Google Scholar
Digital Library
- [83] . 2001. Extractors and pseudorandom generators. J. ACM 48, 4 (2001), 860–879.Google Scholar
Digital Library
- [84] . 2000. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS’00). IEEE, 32–42.Google Scholar
Cross Ref
- [85] . 2003. Pseudo-random generators for all hardnesses. J. Comput. Syst. Sci. 67, 2 (2003), 419–440.Google Scholar
Digital Library
- [86] . 2012. Pseudorandomness. Found. Trends® Theoret. Comput. Sci. 7, 1–3 (2012), 1–336.Google Scholar
Cross Ref
- [87] . 2013. Multi-point evaluation in higher dimensions. Applic. Algeb. Eng., Commun. Comput. 24, 1 (2013), 37–52.Google Scholar
Cross Ref
- [88] . 2003. Hardness vs. randomness within alternating time. In Proceedings of the 18th IEEE Annual Conference on Computational Complexity (CCC’03). IEEE, 53–69.Google Scholar
Cross Ref
- [89] . 2013. Modern Computer Algebra. Cambridge University Press.Google Scholar
Cross Ref
- [90] . 2004. On pseudoentropy versus compressibility. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC’04). IEEE, 29–41.Google Scholar
Digital Library
- [91] . 2013. Barriers in cryptography with weak, correlated and leaky sources. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science. ACM, 111–126.Google Scholar
Digital Library
- [92] . 2016. Strong ETH breaks with Merlin and Arthur: Short non-interactive proofs of batch evaluation. In Proceedings of the 31st Annual Conference on Computational Complexity (CCC’16). 2:1–2:17.Google Scholar
- [93] . 1982. Theory and application of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS’82). IEEE, 80–91.Google Scholar
Digital Library
- [94] . 2012. Locally decodable codes. Found. Trends® Theoret. Comput. Sci. 6, 3 (2012), 139–255.Google Scholar
Cross Ref
- [95] . 1997. Randomness-optimal oblivious sampling. Rand. Struct. Algor. 11, 4 (1997), 345–367.Google Scholar
Digital Library
- [96] . 2007. Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theor. Comput. 3 (2007), 103–128.Google Scholar
Cross Ref
Index Terms
Nearly Optimal Pseudorandomness from Hardness
Recommendations
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingWe give a randomness-efficient Massively Parallel Computation (MPC) algorithm for deciding whether an undirected graph is connected. For Connectivity on n-vertex, m-edge graphs whose components have diameter at most D = 2o(log n/ log log n), our ...
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceIn this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: we show how to maintain (using only O(log n//spl epsiv//sup 2/) words of storage) a sketch C(p) of ...
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence
SPAA '23: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and ArchitecturesThe paper presents parallel algorithms for multiplying implicit simple unit-Monge matrices (Krusche and Tiskin, PPAM 2009) of size n x n in the EREW PRAM model. We show implicit simple unit-Monge matrices multiplication of size n x n can be achieved by ...






Comments