On the complexity of dualization of monotone disjunctive normal forms

被引：266

作者：

Fredman, ML

Khachiyan, L

机构：

[1] Department of Computer Science, Rutgers University, New Brunswick

来源：

JOURNAL OF ALGORITHMS | 1996年 / 21卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/jagm.1996.0062

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：618 / 628

页数：11

共 50 条

[1] Efficient dualization of O(log n)-term monotone disjunctive normal forms
Makino, K
[J]. DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 305 - 312
[2] On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Gurvich, V
Khachiyan, L
[J]. DISCRETE APPLIED MATHEMATICS, 1999, 97 : 363 - 373
[3] On the complexity of the multiplication method for monotone CNF/DNF dualization
Elbassioni, Khaled M.
[J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 340 - 351
[4] On the complexity of monotone dualization and generating minimal hypergraph transversals
Elbassioni, Khaled M.
[J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (11) : 2109 - 2123
[5] SOME ESTIMATES OF THE COMPLEXITY OF DISJUNCTIVE NORMAL FORMS OF A RANDOM BOOLEAN FUNCTION
TOMAN, E
TOMANOVA, J
[J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1991, 10 (04): : 327 - 340
[6] ON LOWER BOUNDS FOR THE COMPLEXITY OF DISJUNCTIVE NORMAL FORMS OF BOOLEAN FUNCTIONS WITH A SMALL NUMBER OF ZEROS
KOGAN, AY
[J]. USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1987, 27 (11-12): : 175 - 181
[7] SIMPLIFICATION ALGORITHMS FOR DISJUNCTIVE NORMAL FORMS
ZHURAVLEV, II
[J]. DOKLADY AKADEMII NAUK SSSR, 1960, 132 (02): : 260 - 263
[8] THE PROBLEM OF MINIMIZATION OF DISJUNCTIVE NORMAL FORMS
ANDREEV, AE
[J]. DOKLADY AKADEMII NAUK SSSR, 1984, 274 (02): : 265 - 269
[9] THE NUMBER OF IRREDUNDANT DISJUNCTIVE NORMAL FORMS
CHUKHROV, IP
[J]. DOKLADY AKADEMII NAUK SSSR, 1982, 262 (06): : 1329 - 1332
[10] THE NUMBER OF MINIMAL DISJUNCTIVE NORMAL FORMS
CHUKHROV, IP
[J]. DOKLADY AKADEMII NAUK SSSR, 1984, 276 (06): : 1335 - 1339

← 1 2 3 4 5 →