COMPLEXITY RESULTS FOR CLASSES OF QUANTIFICATIONAL FORMULAS

被引：109

作者：

LEWIS, HR

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(80)90027-6

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：317 / 353

页数：37

共 32 条

[1] LINEAR SAMPLING AND AEA CASE OF DECISION PROBLEM [J].

AANDERAA, SO ;

LEWIS, HR .

[2] The satisfiability of some numerical expressions [J].

Ackermann, W .

[3]

Ackermann W., 1954, SOLVABLE CASES DECIS

[4]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[5]

Berman L., 1977, 18th Annual Symposium on Foundations of Computer Science, P95, DOI 10.1109/SFCS.1977.23

[6] The decision problem of mathematical logic [J].

Bernays, P ;

Schonfinkel, M .

[7]

Chandra A. K., 1976, 17TH P IEEE S F COMP, P98, DOI DOI 10.1109/SFCS.1976.4

[8]

Cook S. A., 1973, Journal of Computer and System Sciences, V7, P343, DOI 10.1016/S0022-0000(73)80028-5

[9] CLASSIFICATION OF AEA FORMULAS BY LETTER ATOMS [J].

DREBEN, B ;

WANG, H ;

KAHR, AS .

[10]

Dreben B., 1979, DECISION PROBLEM SOL