BOUNDS FOR WIDTH 2 BRANCHING PROGRAMS

被引：16

作者：

BORODIN, A

DOLEV, D

FICH, FE

PAUL, W

机构：

[1] UNIV WASHINGTON,SEATTLE,WA 98195

[2] IBM CORP,RES LAB,SAN JOSE,CA 95193

[3] HEBREW UNIV JERUSALEM,IL-91904 GIVAT RAM,ISRAEL

来源：

关键词：

D O I：

10.1137/0215040

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：549 / 560

页数：12

共 18 条

[1]

Borodin A., 1979, 20th Annual Symposium of Foundations of Computer Science, P319, DOI 10.1109/SFCS.1979.4

[2]

BORODIN A, 1983, 15TH ACM STOC, P87

[3]

CHANDRA AK, 1983, 15TH P ACM STOC, P94

[4]

Cobham A., 1966, RC1704 IBM WATS RES

[5]

Erdos P., 1960, J LOND MATH SOC, V35, P85, DOI DOI 10.1112/JLMS/S1-35.1.85

[6] OMEGA(N LOG N) LOWER BOUNDS ON LENGTH OF BOOLEAN-FORMULAS [J].

FISCHER, MJ ;

MEYER, AR ;

PATERSON, MS .

[7]

Furst M., 1981, 22nd Annual Symposium on Foundations of Computer Science, P260, DOI 10.1109/SFCS.1981.35

[8]

HOOVER J, UNPUB CIRCUIT WIDTH

[9]

Khrapchenko V. M., 1972, MATH NOTES, V11, P70

[10]

Khrapchenko V. M., 1972, MAT ZAMETKI, V11, P109