Author:
Huang Xuangui,Viola Emanuele
Publisher
Springer International Publishing
Reference31 articles.
1. Alman, J., Chan, T.M., Williams, R.: Polynomial representations of threshold functions and algorithmic applications. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2016)
2. Alman, J., Chen, L.: Efficient construction of rigid matrices using an NP oracle. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1034–1055 (2019)
3. Ben-Sasson, E., Viola, E.: Short PCPs with projection queries. In: Colloquium on Automata, Languages and Programming (ICALP) (2014)
4. Bhangale, A., Harsha, P., Paradise, O., Tal, A.: Rigid matrices from rectangular PCPs. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2020)
5. Chan, T.M., Williams, R.: Deterministic APSP, orthogonal vectors, and more: quickly derandomizing razborov-smolensky. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1246–1255 (2016)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rigid Matrices from Rectangular PCPs;SIAM Journal on Computing;2024-04-03
2. On the Range Avoidance Problem for Circuits;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization;SIAM Journal on Computing;2022-05-02