Skip to main content
SpringerLink
Log in

Boolesche Minimalpolynome und Überdeckungsprobleme

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The main difficulty in finding minimal Boolean polynomials for given switching functions comes from the evaluation of the table of prime implicants.

We show the following results:

  1. 1)

    Switching functions with “don't care”-points and those without yield essentially the same class of tables of prime implicants.

  2. 2)

    A polynomial, which is minimal with respect to the costfunction, which counts the entries of conjunctions and disjunctions, must not be a polynomial with a minimal number of prime implicants.

  3. 3)

    Each binary matrix with at least one 1 in each row and column is the prime implicant table of some switching-function. Moreover this function can be constructed such that its prime implicants have arbitrarily prescribed costs.

Finally we make some remarks about the complexity of algorithms, which—given the graph of a switching function—find a minimal polynomial of this function.

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

Literatur

  1. Aho, A. V., Hopcroft, J. E., Ullman, J. P.: The design and analysis of computer algorithms. Reading (Mass.): Addison Wesley 1974

    Google Scholar 

  2. Cobham, A., North, J. H.: Extension of the integer programming approach to the minimization of Boolean functions. Thomas J. Watson Research Ctr., IBM Corporation, Yorktown Heights (N.Y.), IBM Research Report RC-915, 1963

    Google Scholar 

  3. Cook, S.A.: The complexity of theorem-proving procedures. Proc. Third Annual ACM Symposium on Theory of Computing, Shakerheights, Ohio, 1971, p. 151–158

  4. Garey, M. R., Johnson, D. S., Stockmeyer, L.: Some simplified NP-complete problems. Proc. Sixth Annual ACM Symposium on Theory of Computing, Seatle (Wash.), 1974, p. 47–63

  5. Gimpel, J. F.: A method of producing a Boolean function having an arbitrarily prescribed prime implicant table. IEEE-EC 14, 485–488 (1965)

    Google Scholar 

  6. Hotz, G.: Schaltkreistheorie. Berlin-New York: de Gruyter 1974

    Google Scholar 

  7. Karp, R. M.: Reducibility among combinatorial problems. In: Miller, R. E., Thatcher, J.W. (eds.), Complexity of computer computations. Plenum Press 1972

  8. Quine, W. V.: The problem of simplifying truth functions. American Mathematical Monthly 61, 521–531 (1952)

    Google Scholar 

  9. Roth, J. P.: Algebraic topological methods for the synthesis of switching systems. I. Transactions of the American mathematical Society 88, 301–326 (1958)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes, D-6600, Saarbrücken, Bundesrepublik Deutschland

    Wolfgang J. Paul

Authors
  1. Wolfgang J. Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paul, W.J. Boolesche Minimalpolynome und Überdeckungsprobleme. Acta Informatica 4, 321–336 (1975). https://doi.org/10.1007/BF00289615

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289615

Search

Navigation