Asosiy kontentga oʻtish
Maqola

Asymptotically optimal dualization algorithms

E. V. DjukovaComputing CenterP. A. ProkofjevRussian Academy of Sciences
2015en

Ochiq kirish: yoʻq

ABI

Annotatsiya

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.

Hali tarjima qilinmagan

Identifikatorlar

Iqtiboslar va manbalar

2 ta iqtibos0 ta foydalanilgan manba