Zobrazeno 1 - 2
of 2
pro vyhledávání: '"combinatorial method of minimizing Boolean functions"'
Autor:
Volodymyr Riznyk, Mykhailo Solomko
Publikováno v:
Tehnologìčnij Audit ta Rezervi Virobnictva, Vol 5, Iss 2(43), Pp 42-55 (2018)
The object of research is the combinatorial method of minimizing conjunctive normal forms (CNF) of Boolean functions in order to reduce its algorithmic complexity. One of the most places to minimize CNF of Boolean functions is the complexity of the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9ab34019c7e097f44901a2e9b4a33f5
https://doi.org/10.15587/2312-8372.2018.146312
https://doi.org/10.15587/2312-8372.2018.146312
Autor:
Riznyk, Volodymyr, Solomko, Mykhailo
Publikováno v:
Technology audit and production reserves; Том 5, № 2(43) (2018): Information and control systems; 42-55
Технологічний аудит та резерви виробництва; Том 5, № 2(43) (2018): Інформаційно-керуючі системи; 42-55
Технологический аудит и резервы производства; Том 5, № 2(43) (2018): Информационно-управляющие системы; 42-55
Технологічний аудит та резерви виробництва; Том 5, № 2(43) (2018): Інформаційно-керуючі системи; 42-55
Технологический аудит и резервы производства; Том 5, № 2(43) (2018): Информационно-управляющие системы; 42-55
The object of research is the combinatorial method of minimizing conjunctive normal forms (CNF) of Boolean functions in order to reduce its algorithmic complexity. One of the most places to minimize CNF of Boolean functions is the complexity of the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=scientific_p::6a11196089501db73015ec77d3a1adf3
http://journals.uran.ua/tarp/article/view/146312
http://journals.uran.ua/tarp/article/view/146312