Results 191 to 200 of about 1,765 (205)

Linearized disjunctive normal forms of boolean functions

1987
openaire   +1 more source

The principle of raising the degree of indeterminacy of Boolean functions, and an algorithm for determining shortest disjunctive normal forms

, 1971
Yu. N. Kornev
openalex   +1 more source

The many benefits of putting stack filters into disjunctive or conjunctive normal form

, 2005
Marcel Wild
openalex   +1 more source

A comparison of the complexity of the longest and shortest disjunctive normal forms and a lower bound for the number of prime disjunctive normal forms for almost all Boolean functions

, 1972
A. D. Korshunov
openalex   +1 more source

A Local algorithm of index 1 for constructing the sum of dead-end disjunctive normal forms for functions of k-valued logic

, 1977
A.N. Nurlybaev
openalex   +1 more source

Learning disjunctive normal forms in a dual classifier system (Extended abstract)

Lecture Notes in Computer Science, 2005
exaly  

The reduction generated algorithm of minimal disjunctive normal form based on discernibility matrix

2012
exaly  

Mapping of reduced disjunctive normal forms onto graphs

Cybernetics and Systems Analysis, 1980
exaly  

A MODEL OF A DOCUMENT RETRIEVAL SYSTEM BASED ON THE CONCEPT OF A SEMANTIC DISJUNCTIVE NORMAL FORM

Kybernetes, 1981
exaly  

Recognition method based on classification by disjunctive normal forms

Cybernetics, 1976
openaire   +1 more source