Author:
Atserias Albert,Galesi Nicola,Pudlák Pavel
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference17 articles.
1. An O(nlog n) sorting network;Ajtai;Combinatorica,1983
2. Monotone proofs of the pigeon-hole principle;Atserias;Mathematical Logic Quarterly,2001
3. Monotone sequent calculus and resolution;Bı́lková;Comment. Math. Univ. Carolinae,2001
4. Polynomial size proofs of the propositional pigeonhole principle;Buss;J. Symbolic Logic,1987
5. On the computational content of intuitionistic propositional proofs;Buss;Ann. Pure Appl. Logic,2001
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proof Complexity of Monotone Branching Programs;Revolutions and Revelations in Computability;2022
2. On $$\epsilon$$-sensitive monotone computations;computational complexity;2020-07-25
3. Expander construction in VNC1;Annals of Pure and Applied Logic;2020-07
4. Index;Proof Complexity;2019-03-28
5. Bibliography;Proof Complexity;2019-03-28