PLANAR FORMULAS AND THEIR USES

被引：435

作者：

LICHTENSTEIN, D

机构：

来源：

关键词：

D O I：

10.1137/0211025

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：329 / 343

页数：15

共 13 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

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

[3]

FRAENKEL A, 1978, 19TH P ANN S F COMP, P55

[4]

Garey M. R., 1976, SIAM Journal on Computing, V5, P704, DOI 10.1137/0205049

[5] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE [J].

GAREY, MR ;

JOHNSON, DS .

[6]

Karp R. M., 1972, COMPLEXITY COMPUTER, P85

[7] GO IS POLYNOMINAL-SPACE HARD [J].

LICHTENSTEIN, D ;

SIPSER, M .

[8]

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

[9]

REISCH S, COMMUNICATION

[10] COMPLEXITY OF SOME 2-PERSON PERFECT-INFORMATION GAMES [J].

SCHAEFER, TJ .