Funder
Austrian Science Fund
NSERC
European Research Council
Reference68 articles.
1. Σ11 formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. Pseudorandom generators in propositional proof complexity;Alekhnovich;SIAM J. Comput.,2004
3. Computational Complexity: A Modern Approach;Arora,2009
4. The ordering principle in a fragment of approximate counting;Atserias;ACM Trans. Comput. Log.,2014
5. The complexity of finite functions;Boppana,1990
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Localizability of the approximation method;computational complexity;2024-09-05
2. On the Consistency of Circuit Lower Bounds for Non-deterministic Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Open Problems Column;ACM SIGACT News;2022-12-19