共 50 条
- [31] MINIMIZATION OF NOR AND NAND NETWORKS OF INHIBITED AND CONJUNCTIVE FORMS OF BOOLEAN FUNCTIONS AUTOMATISME, 1977, 22 (3-4): : 83 - 98
- [35] Minimization method of Boolean functions Problemy Upravleniya I Informatiki (Avtomatika), 1997, (02): : 100 - 113
- [36] On the testability of implementations of Boolean functions based on full normal forms Eng Simul, 5-6 (799-805):
- [37] An upper bound for complexity of polynomial normal forms of Boolean functions DISCRETE MATHEMATICS AND APPLICATIONS, 2005, 15 (04): : 351 - 360
- [38] SIMPLIFICATION ALGORITHMS FOR DISJUNCTIVE NORMAL FORMS DOKLADY AKADEMII NAUK SSSR, 1960, 132 (02): : 260 - 263
- [39] THE NUMBER OF IRREDUNDANT DISJUNCTIVE NORMAL FORMS DOKLADY AKADEMII NAUK SSSR, 1982, 262 (06): : 1329 - 1332
- [40] BEST LOCAL ALGORITHM OF INDEX 1 FOR CONSTRUCTION OF SUM OF BOOLEAN FUNCTION MINIMUM DISJUNCTIVE NORMAL FORMS DOKLADY AKADEMII NAUK SSSR, 1973, 212 (04): : 816 - 817