Affiliation:
1. Institute of Computer Aided Design of the Russian Academy of Sciences (ICAD RAS)
Abstract
The article is written on the basis of reports presented at the XII International Seminar. Discrete mathematics and its applications named after academician O. B. Lupanov (Moscow, Moscow State University, June 20–25, 2016) and contains a survey of results for the problem of minimizing Boolean functions, in which methods are considered for proving the minimality and nonconstructive approaches to obtaining estimates of parameters that characterize the complexity of minimization with respect to classes of measures difficulties.
Publisher
Keldysh Institute of Applied Mathematics
Subject
Energy (miscellaneous),Energy Engineering and Power Technology,Renewable Energy, Sustainability and the Environment,Environmental Engineering,Pollution,Nuclear Energy and Engineering,Renewable Energy, Sustainability and the Environment,Environmental Chemistry,General Engineering,Energy Engineering and Power Technology,Fuel Technology,Nuclear Energy and Engineering,Renewable Energy, Sustainability and the Environment,Energy Engineering and Power Technology,Fuel Technology,Nuclear Energy and Engineering,Renewable Energy, Sustainability and the Environment,General Energy,Economics and Econometrics,General Energy,Energy Engineering and Power Technology,Building and Construction,Renewable Energy, Sustainability and the Environment,Energy Engineering and Power Technology,Fuel Technology,Nuclear Energy and Engineering,Renewable Energy, Sustainability and the Environment,Management, Monitoring, Policy and Law,Renewable Energy, Sustainability and the Environment,Geography, Planning and Development
Reference35 articles.
1. Андреев А. Е. Об одной модификации градиентного алгоритма // Вестник МГУ. Серия 1. Математика. Механика. — 1985. — № 3. — С. 29–35.
2. Глаголев В. В. О длине тупиковой дизъюнктивной нормальной формы // Математические заметки. — 1967. — Т. 2, № 6. — С. 665–672.
3. Глаголев В. В. Некоторые оценки дизъюнктивных нормальных форм функций алгебры логики // Проблемы кибернетики. Вып. 19. — М.: Наука, 1967 — С. 75–94.
4. Дискретная математика и математические вопросы кибернетики. Т. I. / Под ред. В. Я б л о н с к о г о и О. Б. Л у п а н о в а. — М.: Наука, 1974.
5. Еремеев А. В., Заозерская Л. А., Колоколов А. А. Задача о покрытии: сложность, алгоритмы, экспериментальные исследования // Дискретный анализ и исследование операций. Серия 2. — 2000. — Т. 7, № 2. — С. 22–46.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献