Author:
Razborov Alexander A,Rudich Steven
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference40 articles.
1. Σ11-formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. The monotone circuit complexity of Boolean functions;Alon;Combinatorica,1987
3. On a method for obtaining lower bounds for the complexity of individual monotone functions;Andreev;Soviet Math. Dokl.,1985
4. On one method of obtaining effective lower bounds of monotone complexity;Andreev;Algebra i Logika,1987
5. On a method for obtaining more than quadratic effective lower bounds for the complexity ofπ;Andreev;Moscow Univ. Math. Bull.,1987
Cited by
296 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Localizability of the approximation method;computational complexity;2024-09-05
2. Computationally Hard Problems for Logic Programs under Answer Set Semantics;ACM Transactions on Computational Logic;2024-07-10
3. On the Power of Interactive Proofs for Learning;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Beating Brute Force for Compression Problems;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10