COMBINATORIAL PROBLEM WHICH IS COMPLETE IN POLYNOMIAL SPACE

被引：68

作者：

EVEN, S

TARJAN, RE

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL

[2] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1145/321978.321989

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：710 / 719

页数：10

共 10 条

[1]

AHO AV, 1974, DESIGN ANALYSIS COMP

BRUNO, J ;

WEINBERG, L .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (01) :74-&

[3]

CHASE S, 1970, RC3121 IBM TT WATS R

[4]

Cook SA., 1971, 3RD P ANN ACM S THEO, P151, DOI [DOI 10.1145/800157.805047, 10.1145/800157.805047]

[5]

Karp R.M., 1972, Complexity of Computer Computations, P85

[6]

MEYER AR, 1973, 5TH P ANN ACM S THEO, P1

[7]

Nilsson N.J., 1971, Problem-Solving Methods in Artificial Intelligence

[8]

SCHAEFER TJ, 1976, 8TH P ANN ACM S THEO, P41

[9]

Tarjan R., 1971, Conference record 1971 12th annual symposium on switching and automata theory, P114, DOI 10.1137/0201010

[10]

TARJAN R, UNPUBLISHED NOTES