Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference56 articles.
1. Noga Alon, Peter Frankl & Vojtech Rödl (1985). Geometrical Realization of Set Systems and Probabilistic Communication Complexity. In 26th Annual Symposium on Foundations of Computer Science, 21–23 October 1985, Portland, Oregon, USA, 277–280. IEEE Computer Society.
2. Dana Angluin (1980) On Counting Problems and the Polynomial- Time Hierarchy. Theor. Comput. Sci. 12: 161–173
3. Sanjeev Arora & Boaz Barak (2009). Computational Complexity. Cambridge University Press.
4. László Babai, Peter Frankl & Janos Simon (1986). Complexity classes in communication complexity theory (preliminary version). In 27th Annual Symposium on Foundations of Computer Science, FOCS 1986, 27–29 October 1986, Toronto, Ontario, Canada, 337–347. IEEE Computer Society.
5. José L. Balcázar, Josep Díaz & Joaquim Gabarró (1990). Structural Complexity II. Texts in Theoretical Computer Science, An EATCS Series. Springer-Verlag, 1st edition.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Limits of Preprocessing;computational complexity;2024-05-23
2. Rigid Matrices from Rectangular PCPs;SIAM Journal on Computing;2024-04-03
3. Efficient Construction of Rigid Matrices Using an NP Oracle;SIAM Journal on Computing;2022-03-07
4. Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
5. Efficient Construction of Rigid Matrices Using an NP Oracle;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11