Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm
暂无分享,去创建一个
Pavel Hrubes | Lindyanne Alexander | Linda Sharp | Nicola M. Gray | Rashmi Seth | A. Robertson | Margaret Cruickshank | Seonaidh | C. Cotton | Julian Little | Ian Duncan | David Jenkins | Zoë Philips | Linda Sharp | A. Robertson | Seonaidh | C. Cotton | Ian Duncan | Margaret E Cruickshank | David Jenkins | Zoë Philips
[1] Czech Republickrajicek. Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .
[2] Éva Tardos,et al. The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..
[3] Samuel R. Buss,et al. On the computational content of intuitionistic propositional proofs , 2001, Ann. Pure Appl. Log..
[4] Arist Kojevnikov,et al. Intuitionistic Frege systems are polynomially equivalent , 2006 .
[5] Samuel R. Buss,et al. The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic , 1999, Ann. Pure Appl. Log..
[6] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..
[7] Richard Statman,et al. Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..
[8] Pavel Hrubes,et al. Lower bounds for modal logics , 2007, Journal of Symbolic Logic.
[9] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[10] R. Statman. Speed-up by theories with infinite models , 1981 .