Minimization of Boolean functions in the class of orthogonal disjunctive normal forms

The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be orthogonal, i. e. the conjunction of them would be equa...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsman: Yu. V. Pottosin
Materialtyp: Artigo
Språk:Russo
Publicerad: The United Institute of Informatics Problems of the National Academy of Sciences of Belarus 2021-07-01
Serie:Informatika
Ämnen:
boolean function
disjunctive normal form
orthogonal terms
short cover problem
intersection graph
dominating set
independent set
Länkar:https://inf.grid.by/jour/article/view/1131
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk