Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 22 октября 2015 г.
Аннотация: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 ear lier constructed asymptotically optimal dualization algorithms and other available dualization algorithms with different design features.
Keywords: dualization, Boolean matrix, asymptotically optimal algorithm, irreducible covering, enumeration with a polynomialtime delay.