Author:
Impagliazzo Russell,Kabanets Valentine,Volkovich Ilya
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference53 articles.
1. L. M. Adleman (1978). Two Theorems on Random Polynomial Time.
In Proceedings of the 19th Annual IEEE Symposium on Foundations of
Computer Science (FOCS), 75–83.
2. E. Allender, H. Buhrman, M.l Koucký, D. van Melkebeek &
D. Ronneburger (2006). Power from Random Strings. SIAM J. Comput.
35(6), 1467–1493. URL http://dx.doi.org/10.1137/050628994.
3. E. Allender & B. Das (2014). Zero Knowledge and Circuit Minimization.
In Mathematical Foundations of Computer Scienc MFCS,
25–32.
4. E. Allender, L. Hellerstein, P. McCabe, T. Pitassi & M. E.
Saks (2008). Minimizing Disjunctive Normal Form Formulas and AC0
Circuits Given a Truth Table. SIAM J. Comput. 38(1), 63–84. URL
http://dx.doi.org/10.1137/060664537.
5. E. Allender, D. Holden & V. Kabanets (2015). The Minimum
Oracle Circuit Size Problem. In 32nd International Symposium on
Theoretical Aspects of Computer Science, STACS 2015, March 4-7,
2015, Garching, Germany, 21–33. URL http://dx.doi.org/10.4230/LIPIcs.STACS.2015.21.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06