Proving Lower Bounds Via Pseudo-random Generators-Reference-Cited by-同舟云学术

Proving Lower Bounds Via Pseudo-random Generators

Published:2005 Issue: Volume: Page:92-105
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Agrawal Manindra

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11590156_6.pdf

Reference24 articles.

1. Agrawal On, M.: derandomizing tests for certain polynomial identities. In: Proceedings of the Conference on Computational Complexity, pp. 355–362 (2003)

2. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)

3. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost fc-wise independent random variables. In: Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pp. 544–553 (1990)

4. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing 13, 850–864 (1984)

5. Damm, C.: DET=L#l . Technical Report Informatik-preprint 8, Fachbereich In- formatik der Humboldt Universitat zu Berlin (1991)

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

1. Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements;Problems of Information Transmission;2023-01

2. Derandomization from Algebraic Hardness;SIAM Journal on Computing;2022-04

3. Demystifying the border of depth-3 algebraic circuits;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

4. Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

5. Polynomial time deterministic identity testing algorithm for Σ [3] ΠΣΠ [2] circuits via Edelstein–Kelly type theorem for quadratic polynomials;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15