All
 
|
 
 


The problem of monotone dualization and its generalization: asymptotic estimates of the number of solutions
 
PIIS004446690003559-5-1
DOI10.31857/S004446690003559-5
Publication type Article
Status Published
Authors
E. Dyukova 
Affiliation: FIZ IU RAS
Address: Russian Federation
Yu. Zhuravlev
Affiliation: FIZ IU RAS
Address: Russian Federation
Journal nameZhurnal vychislitelnoi matematiki i matematicheskoi fiziki
EditionVolume 58 Issue 12
Pages2153-2168
Abstract

  

Keywords
AcknowledgmentThis work was supported by the Russian Foundation for Basic Research (project code 16-01-00445-a).
Received23.01.2019
Publication date23.01.2019
Cite   Download pdf To download PDF you should sign in
Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

views: 1038

Readers community rating: votes 0 

1. Dyukova E.V. O slozhnosti realizatsii nekotorykh protsedur raspoznavaniya // Zh. vychisl. matem. i matem. fiz. 1987. T. 27. № 1. S. 114–127.
2. Dyukova E.V. Algoritmy raspoznavaniya tipa "Kora": slozhnost' realizatsii i metricheskie svojstva // Raspoznavanie, klassifikatsiya, prognoz (matem. metody i ikh primenenie). M.: Nauka, 1989. Vyp. 2. S. 99–125.
3. Dyukova E.V. Asimptoticheskie otsenki nekotorykh kharakteristik mnozhestva predstavitel'nykh naborov i zadacha ob ustojchivosti // Zh. vychisl. matem. i matem. fiz. 1995. T. 35. No 1. S. 123–134.
4. Dyukova E.V., Zhuravlev Yu.I. Diskretnyj analiz priznakovykh opisanij v zadachakh raspoznavaniya bol'shoj razmernosti // Zh. vychisl. matem. i matem. fiz. 2000. T. 40. №8. S. 1264–1278.
5. Dyukova E.V. O slozhnosti realizatsii diskretnykh (logicheskikh) protsedur raspoznavaniya // Zh. vychisl. matem. i matem. fiz. 2004. T. 44. № 3. S. 551–561.
6. Djukova E.V., Nefedov V.Yu. The Complexity of Transformation of Normal Forms for Characteristic Functions of Classes // Pattern Recognition and Image Analysis, 2009, Vol. 19, No. 3, pp. 435–440.
7. Jonson D.S., Yannakakis M., Papadimitriou C.H. On general all maximal independent sets // Information Processing Letts. 1988. V. 27. P. 119–123.
8. Fredman M.L., Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms // J. Algorithms. 1996. V. 21. P. 618–628.
9. Dyukova E. V. Ob asimptoticheski optimal'nom algoritme postroeniya tupikovykh testov // DAN SSSR. 1977. T. 233. № 4. S. 527–530.
10. Dyukova E.V. Asimptoticheski optimal'nye testovye algoritmy v zadachakh raspoznavaniya // Probl. kibernetiki. M.: Nauka, 1982. Vyp. 39. S. 165–199.
11. Dyukova E.V., Inyakin A.S. Asimptoticheski optimal'noe postroenie tupikovykh pokrytij tselochislennoj matritsy // Matematicheskie voprosy kibernetiki. M.: Nauka, 2008. №17. S. 235–246.
12. Dyukova E.V., Prokof'ev P.A. Ob asimptoticheski optimal'nom perechislenii neprivodimykh pokrytij bulevoj matritsy // Prikladnaya diskretnaya matematika, 2014. № 1(23). S. 96–105.
13. Dyukova E.V., Prokof'ev P.A. Ob asimptoticheski optimal'nykh algoritmakh dualizatsii // Zhurnal vychislitel'noj matematiki i matematicheskoj fiziki. 2015. T. 55, № 5. S. 895–910.
14. Noskov V.N., Slepyan V.A. O chisle tupikovykh testov dlya odnogo klassa tablits // Kibernetika. 1972. № 1. S. 60–65.
15. Andreev A.E. Ob asimptoticheskom povedenii chisla tupikovykh testov i dliny minimal'nogo testa dlya pochti vsekh tablits // Probl. kibernetiki. M: Nauka, 1984. Vyp. 41. S. 117–142.

Система Orphus

Loading...
Up