1. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas;Aharoni;J. Combin. Theory Ser. A,1986
2. Simplified and improved resolution lower bounds;Beame,1996
3. Propositional proof complexity: past, present, future;Beame;Bull. Eur. Assoc. Theor. Comput. Sci. EATCS,1998
4. Resolution and the weak pigeonhole principle;Buss,1997
5. Time bounded random access machines;Cook;J. Comput. System Sci.,1973