|
This article is cited in 10 scientific papers (total in 10 papers)
Asymptotically optimal dualization algorithms
E. V. Djukova, P. A. Prokofjev Dorodnicyn Computing Center, Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia
Abstract:
The design of efficient on average algorithms for discrete enumeration problems is studied. The dualization problem, which is a central enumeration problem, is considered. New asymptotically optimal dualization algorithms are constructed. It is shown that they are superior in time costs to earlier constructed asymptotically optimal dualization algorithms and other available dualization algorithms with different design features.
Key words:
dualization, Boolean matrix, asymptotically optimal algorithm, irreducible covering, enumeration with a polynomial-time delay.
Received: 29.10.2014
Citation:
E. V. Djukova, P. A. Prokofjev, “Asymptotically optimal dualization algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 55:5 (2015), 895–910; Comput. Math. Math. Phys., 55:5 (2015), 891–905
Linking options:
https://www.mathnet.ru/eng/zvmmf10212 https://www.mathnet.ru/eng/zvmmf/v55/i5/p895
|
Statistics & downloads: |
Abstract page: | 322 | Full-text PDF : | 227 | References: | 57 | First page: | 10 |
|