HARD EXAMPLES FOR RESOLUTION

被引：248

作者：

URQUHART, A

机构：

来源：

关键词：

D O I：

10.1145/7531.8928

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：209 / 219

页数：11

共 18 条

[1] A SIMPLIFIED PROOF THAT REGULAR RESOLUTION IS EXPONENTIAL [J].

BENARI, M .

[2]

BLAKE A, 1938, J SYMBOLIC LOGIC, V3, P93

[3]

Church, 1956, INTRO MATH LOGIC, V1

[4]

COOK S, 1976, ACM SIGACT NEWS, V8, P28

[5] RELATIVE EFFICIENCY OF PROPOSITIONAL PROOF SYSTEMS [J].

COOK, SA ;

RECKHOW, RA .

[6]

Gabber O., 1979, 20th Annual Symposium of Foundations of Computer Science, P364, DOI 10.1109/SFCS.1979.16

[7]

Galil Z., 1977, SIAM Journal on Computing, V6, P444, DOI 10.1137/0206031

[8]

Galil Z., 1977, Theoretical Computer Science, V4, P23, DOI 10.1016/0304-3975(77)90054-8

[9] THE INTRACTABILITY OF RESOLUTION [J].

HAKEN, A .

[10]

Johnson NL, 1970, DISCRETE DISTRIBUTIO