Skip to main content
SpringerLink
Log in

On the number of DNF minimal relatively arbitrary measures of complexity

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

  • 140 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Bibliography

  1. Čuhrov I.P., On the number of irredundant disjunctive normal forms. DAN USSR, v. 262, 6, 1982, 1329–1332.

    Google Scholar 

  2. Čuhrov I.P., On the number of minimal disjunctive normal forms. DAN USSR, v.276, 6, 1984, 1335–1339.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Scientific council of AS USSR on complex problem "Cybernetics", Moscow, USSR

    I. P. Čuhrov

Authors
  1. I. P. Čuhrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Čuhrov, I.P. (1987). On the number of DNF minimal relatively arbitrary measures of complexity. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation