FUNCTIONS COMPUTED BY MONOTONE BOOLEAN-FORMULAS WITH NO REPEATED VARIABLES

被引：15

作者：

MUNDICI, D

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(89)90150-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：113 / 114

页数：2

共 9 条

[1]

[Anonymous], 1987, COMPLEXITY BOOLEAN F

[2] GREEDY PACKING AND SERIES-PARALLEL GRAPHS [J].

HOFFMAN, AJ ;

TUCKER, AC .

[3]

HUNT HB, 1986, LECT NOTES COMPUT SC, V210, P277

[4] A SOLUTION OF THE SHANNON SWITCHING GAME [J].

LEHMAN, A .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (04) :687-725

[5]

MCCOLL WF, 1985, LECT NOTES COMPUT SC, V182, P219

[6]

SAVAGE JE, 1976, COMPLEXITY COMPUTING

[7] THE RECOGNITION OF SERIES-PARALLEL DIGRAPHS [J].

VALDES, J ;

TARJAN, RE ;

LAWLER, EL .

[8]

WELSH D, 1976, LONDON MATH SOC MONO, V8

[9]

WHITE N, 1986, ENCY MATH ITS APPLIC, V26