Skip to main content
SpringerLink
Log in

Asymptotic estimates for the number of solutions of the dualization problem and its generalizations

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

Asymptotic estimates for the typical number of irreducible coverings and the typical length of an irreducible covering of a Boolean matrix are obtained in the case when the number of rows is no less than the number of columns. As a consequence, asymptotic estimates are obtained for the typical number of maximal conjunctions and the typical rank of a maximal conjunction of a monotone Boolean function of variables defined by a conjunctive normal form of clauses. Similar estimates are given for the number of irredundant coverings and the length of an irredundant covering of an integer matrix (for the number of maximal conjunctions and the rank of a maximal conjunction of a two-valued logical function defined by its zero set). Results obtained previously in this area are overviewed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. A. Chegis and S. V. Yablonskii, “Logical Methods for Electric Circuit Control,” Tr. Mat. Inst. im. V.A. Steklova Akad. Nauk SSSR 51, 270–360 (1958).

    MATH  Google Scholar 

  2. E. V. Djukova, “Asymptotically Optimal Algorithm for Constricting Irredundant Tests,” Dokl. Akad. Nauk SSSR 233, 527–530 (1977).

    MathSciNet  Google Scholar 

  3. E. V. Djukova, “Asymptotically Optimal Test Algorithms in Recognition Problems,” in Problems in Cybernetics (Nauka, Moscow, 1982), No. 39, pp. 165–169 [in Russian].

    Google Scholar 

  4. E. V. Djukova, “On the Implementation Complexity of Some Recognition Procedures,” Zh. Vychisl. Mat. Mat. Fiz. 27, 114–127 (1987).

    Google Scholar 

  5. E. V. Djukova, “Recognition Algorithms of the Kora Type: Complexity of Implementation and Metric Properties,” in Recognition, Classification, Forecast: Mathematical Methods and Their Applications (Nauka, Moscow, 1989), Vol. 2, pp. 99–125 [in Russian].

    Google Scholar 

  6. E. V. Djukova and Yu. I. Zhuravlev, “Discrete Analysis of Feature Descriptions in Recognition Problems of High Dimensionality,” Comput. Math. Math. Phys. 40, 1214–1227 (2000).

    MathSciNet  Google Scholar 

  7. E. V. Djukova, “On the Implementation Complexity of Discrete (Logical) Recognition Procedures,” Comput. Math. Math. Phys. 44, 532–541 (2004).

    MathSciNet  Google Scholar 

  8. E. V. Djukova and A. S. Inyakin, “Asymptotically Optimal Constriction of Irredundant Coverings of an Integer Matrix,” in Mathematical Problems in Cybernetics (Nauka, Moscow, 2008), No. 17, pp. 235–246 [in Russian].

    Google Scholar 

  9. E. V. Djukova and V. Yu. Nefedov, “The Complexity of Transformation of Normal Forms for Characteristic Functions of Classes,” Pattern Recogn. Image Anal. 19, 435–440 (2009).

    Article  Google Scholar 

  10. V. N. Noskov and V. A. Slepyan, “On the Number of Irredundant Tests for a Class of Tables,” in Kibernetika (Kiev, 1972), No. 1, pp. 60–65 [in Russian].

  11. A. A. Sapozhenko, “An Estimate of the Length and Number of Irredundant Disjunctive Normal Forms for Almost All Incompletely Defined Boolean Functions,” Mat. Zametki 28, 279–299 (1980).

    MathSciNet  MATH  Google Scholar 

  12. E. V. Djukova and N. V. Peskov, “Constriction of Recognition Procedures Based on Elementary Classificators,” in Mathematical Problems in Cybernetics (Nauka, Moscow, 2008), No. 14, pp. 57–92.

    Google Scholar 

  13. E. V. Djukova and A. S. Inyakin, “Classification Procedures Based on the Construction of Class Coverings,” Comput. Math. Math. Phys. 43, 1812–1822 (2003).

    MathSciNet  Google Scholar 

  14. E. V. Djukova, “On the Number of Irreducible Coverings of an Integer Matrix,” Comput. Math. Math. Phys. 45, 903–908 (2005).

    MathSciNet  Google Scholar 

  15. E. V. Djukova, “Metric Properties of Nearly Minimal Coverings of Integer Matrices,” Abstracts of Papers of the International Conference on Intellectual Data Processing (Simferopol’, 2002), pp. 37–38.

  16. E. V. Djukova, “Construction of Irredundant Coverings of a Boolean Matrix,” Dokl. Math. 75, 9–11 (2007).

    Article  MathSciNet  Google Scholar 

  17. E. A. Dem’yanov and E. V. Djukova, “On the Construction of Irredundant Coverings of an Integer Matrix,” Comput. Math. Math. Phys. 47, 518–526 (2007).

    Article  MathSciNet  Google Scholar 

  18. A. E. Andreev, “On the Asymptotic Behavior of the Number of Irredundant Tests and the Length of a Minimal Test for Almost All Tables,” in Problems in Cybernetics (Nauka, Moscow, 1984), No. 41, pp. 117–142 [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333, Russia

    E. V. Djukova & R. M. Sotnezov

Authors
  1. E. V. Djukova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. M. Sotnezov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. V. Djukova.

Additional information

Original Russian Text © E.V. Djukova, R.M. Sotnezov, 2011, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2011, Vol. 51, No. 8, pp. 1531–1540.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Djukova, E.V., Sotnezov, R.M. Asymptotic estimates for the number of solutions of the dualization problem and its generalizations. Comput. Math. and Math. Phys. 51, 1431–1440 (2011). https://doi.org/10.1134/S0965542511080069

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542511080069

Keywords

Search

Navigation