Author:
Ben-Sasson Eli,Kopparty Swastik
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12
2. Weighted Gate Elimination;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14
3. Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012
4. Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012
5. Random low-degree polynomials are hard to approximate;computational complexity;2011-08-04