Abstract
Several types of reductions between finite Boolean functions are introduced and compared. The corresponding degrees are investigated with the purpose to classify Boolean functions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Aho, A.V., Hopcroft, J.E., Ullman, J.D. 1974: The Design and Analysis of Computer Algorithms. Addison-Wesley, 470 pp
Burger, Charlotte N. 1949: Über die Kostenberechnung von kugelähnlichen geometrischen Gebilden. Zeitschr. Anwendb. Nat. Wiss. (Zürich) vol. 1, pp. 59–95
Cook, Stephen A. 1971: The Complexity of Theorem-Proving Procedures. Proc. 3rd ACM Symp. Theory of Computing, pp. 151–158
Ehrenfeucht, Andrzej 1975: Practical Decidability. J. Comp. Syst. Sc. vol. 11, pp. 392–396
Fischer, Michael J. 1974: Lectures on Network Complexity. Lect. Notes Univ. Frankfurt/Main, F.R. Germany, 25 pp.
Fleischmann, K., Mahr, B., Siefkes, D. 1976: Bounded Concatenation Theory as a Uniform Method for Proving Lower Complexity Bounds. Purdue University CSD-TR 202, 22 pp.; to appear in Proc. 1976 Oxford Summer School in Mathematical Logic
Fürer, M. 1976: Simulation von Turing-Maschinen mit logischen Netzen. In: /Specker-Strassen 1976/, pp. 163–181
Karp, Richard 1972: Reducibility among Combinatorical Problems. In "Complexity of Computer Computations", ed. R. E. Miller and J. Thatcher, Plenum, pp. 85–104
Reynvaan, C., Schnorr, C.-P. 1977: Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. Proc. 3rd GI Conf. Theoretical Computer Sc., Springer Lect. Notes Comp. Sc. vol. 48, pp. 368–390
Savage, J.E. 1972: Computational Work and Time on Finite Machines, Journ. ACM vol.19, pp. 660–674
Savage, J.E. 1976: The Complexity of Computing, Wiley, 391 pp.
Schnorr, Claus P. 1976: The Network Complexity and the Turing Machine Complexity of Finite Functions. Acta Informatica 7, pp. 95–107
Shannon, C.E. 1949: The Synthesis of Two-Terminal Switching Circuits. Bell Syst. Techn. J. vol. 28, pp. 59–98
Specker, Ernst, Strassen, Volker 1976: Komplexität von Entscheidungsproblemen. Springer Lect. Notes Comp. Sc. vol. 43, 217 pp.
Specker, Ernst, Wick, Georges 1976: Längen von Formeln. In /Specker-Strassen 1976/, pp. 182–217
Thiele, James, Winklamnn, Karl 1976: Personal communication
Zaslavskii, C.D. 1975: On Some Models of Computability of Boolean Functions. In "Math. Found. Comp. Sc. 1975, 4th Symp. Mariańské Lázně", Springer Lect. Notes Comp. Sc. vol. 32, pp. 153–159
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Siefkes, D. (1977). Degrees of circuit complexity. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_124
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_124
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive