NONCONSTRUCTIVE ADVANCES IN POLYNOMIAL-TIME COMPLEXITY

被引：45

作者：

FELLOWS, MR ^{[1
]}

LANGSTON, MA ^{[1
]}

机构：

[1] WASHINGTON STATE UNIV,DEPT COMP SCI,PULLMAN,WA 99164

来源：

INFORMATION PROCESSING LETTERS | 1987年 / 26卷 / 03期

基金：

美国国家科学基金会;

关键词：

GRAPH ALGORITHMS - POLYNOMIAL-TIME COMPLEXITY - POLYNOMIAL-TIME DECISION ALGORITHMS;

D O I：

10.1016/0020-0190(87)90054-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：157 / 162

页数：6

共 15 条

[1] EXACT AND APPROXIMATE SOLUTIONS FOR THE GATE MATRIX LAYOUT PROBLEM [J].

DEO, N ;

KRISHNAMOORTHY, MS ;

LANGSTON, MA .

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (01) :79-84

[2]

Garey MR., 1979, COMPUTERS INTRACTABI

[3]

HWANG D, IN PRESS IEEE INT C

[4]

HWANG D, 1986, COMMUNICATION

[5]

Kashiwabara T., 1979, Proceedings of the 1979 International Symposium on circuits and systems, P82

[6]

LEONG H, IN PRESS IEEE INT C

[7]

LI J, 1983, IEEE INT S CIRCUITS, P1013

[8] A DENSE GATE MATRIX LAYOUT METHOD FOR MOS VLSI [J].

LOPEZ, AD ;

LAW, HFS .

IEEE TRANSACTIONS ON ELECTRON DEVICES, 1980, 27 (08) :1671-1675

[9] DISJOINT PATHS - A SURVEY [J].

ROBERTSON, N ;

SEYMOUR, PD .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (02) :300-305

[10]

ROBERTSON N, 1985, SURVEYS COMBINATORIC, P153

← 1 2 →