Boolesche Minimalpolynome und Überdeckungsprobleme

@article{Paul1974BoolescheMU,
  title={Boolesche Minimalpolynome und {\"U}berdeckungsprobleme},
  author={Wolfgang J. Paul},
  journal={Acta Informatica},
  year={1974},
  volume={4},
  pages={321-336}
}
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) Switching functions with “don't care”-points and those without yield essentially the same class of tables of prime implicants. 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… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

The complexity of theorem - proving procedures

  • S. A. Cook
  • Proc . Third Annual ACM Symposium on Theory of…
  • 1971

The problem of simplifying truth functions

  • W. V. Quine
  • American Mathematical Monthly 61, 521--531
  • 1952

Extension of the integer programming approach to the minimization of Boolean functions

  • A. Cobham, J. H. North
  • Thomas J . Watson Research Ctr

Similar Papers

Loading similar papers…