Abstract
We consider two problems in connection with minimal polynomials of Boolean functions. We first discuss the Disjoint Computation Scheme Hypothesis. Then we show how to compute efficiently minimal polynomials for symmetric Boolean functions.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
5. References
C. Greene and D. Kleitman 1976 Strong versions of Sperner's Theorem, J. of Comb. Theory Series A 20, 1976, 80–88.
A. Odlyzko 1973 On covering a product of sets with products of their subsets, Disc. Math. 5, 1973, 373–380.
W. Paul 1975 Boolesche Minimalpolynome und Überdeckungsprobleme, Acta Inform. 4, 1975, 321–336.
W. Paul 1976 Realizing Boolean functions on disjoint sets of variables, Theor. Comp. Sci. 2, 383–396.
D. Uhlig 1974 On the synthesis of self-correcting schemes from functional elements with a smaller number of reliable elements, Math. Notes Acad. Sci. USSR 15, 1974, 558–562.
D. Uhlig 1984 Zur Parallelberechnung Boolescher Funktionen, TR Ing. hochsch. Mittweida, 1984.
I. Wegener 1987 The complexity of Boolean functions, Wiley-Teubner, 1987, Chichester.
M.H. Young and S. Muroga 1985 Symmetric minimal covering problem and minimal PLA's with symmetric variables, IEEE Transactions on Computers 34, 1985, 523–541.
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voigt, B., Wegener, I. (1989). A remark on minimal polynomials of Boolean functions. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026314
Download citation
DOI: https://doi.org/10.1007/BFb0026314
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51659-0
Online ISBN: 978-3-540-46736-6
eBook Packages: Springer Book Archive