RESOLUTION PROOFS OF GENERALIZED PIGEONHOLE PRINCIPLES

被引:48
作者
BUSS, SR
TURAN, G
机构
[1] UNIV ILLINOIS,DEPT MATH STAT & COMP SCI,CHICAGO,IL 60680
[2] HUNGARIAN ACAD SCI,AUTOMATA THEORY RES GRP,H-6701 SZEGED,HUNGARY
关键词
D O I
10.1016/0304-3975(88)90072-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:311 / 317
页数:7
相关论文
共 7 条
[1]   POLYNOMIAL SIZE PROOFS OF THE PROPOSITIONAL PIGEONHOLE PRINCIPLE [J].
BUSS, SR .
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (04) :916-927
[2]   RELATIVE EFFICIENCY OF PROPOSITIONAL PROOF SYSTEMS [J].
COOK, SA ;
RECKHOW, RA .
JOURNAL OF SYMBOLIC LOGIC, 1979, 44 (01) :36-50
[3]   ON THE COMPLEXITY OF CUTTING-PLANE PROOFS [J].
COOK, W ;
COULLARD, CR ;
TURAN, G .
DISCRETE APPLIED MATHEMATICS, 1987, 18 (01) :25-38
[4]   THE INTRACTABILITY OF RESOLUTION [J].
HAKEN, A .
THEORETICAL COMPUTER SCIENCE, 1985, 39 (2-3) :297-308
[5]  
PARIS J, 1985, LECT NOTES MATH, V1130, P317
[6]  
PARIS JB, IN PRESS J SYMBOLIC
[7]   HARD EXAMPLES FOR RESOLUTION [J].
URQUHART, A .
JOURNAL OF THE ACM, 1987, 34 (01) :209-219