Author:
Alon Noga,Ben-Eliezer Ido,Krivelevich Michael
Publisher
Springer Berlin Heidelberg
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fooling polynomials using invariant theory;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. Small-Bias is Not Enough to Hit Read-Once CNF;Theory of Computing Systems;2016-05-07
3. Random low-degree polynomials are hard to approximate;computational complexity;2011-08-04
4. Random Low Degree Polynomials are Hard to Approximate;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2009