Abstract
The paper by Roman Smolensky is a nice example of the art of studying mathematical structures that are, on the one hand, motivated by real computational problems but are, on the other hand, not obviously related.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon andJ. Bruck, Explicit constructions of depth-2 majority circuits for comparison and addition.SIAM Journal on Discrete Mathematics 7 (1994), 1–8.
J. Bruck, Harmonic analysis of polynomial threshold functions.SIAM Journal on Discrete Mathematics 3 (1990), 168–177.
J. Bruck andR. Smolensky, Polynomial threshold functions, AC0 functions and spectral norms.SIAM Journal on Computing 21 (1992), 33–42.
A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán Threshold circuits of bounded depth. InProc. of IEEE Symp. Found. Comp. Sci., 1987, 99–110.
J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. InProc. IEEE Symp. Found. Comp. Sci., 1994, 42–53.
E. Kushilevitz and Y. Mansour, Learning decision trees using the Fourier spectrum. InACM Symp. on Theory of Computing, 1991, 455–464.
R. J. Lechner, Harmonic analysis of switching functions. InRecent Development in Switching Theory, ed.A. Mukhopadhyay. Academi Press, 1971.
N. Linial, Y. Mansour, andN. Nisan, Constant depth circuits, Fourier transforms, and learnability.J. of the Assoc. for Computing Mach. 40 (1993), 607–620.
I. Ninomiya, A theory of coordinate representation of switching functions.Memoirs of the Faculty of Engineering, Nagoya University 10 (1958), 175–190.
A. Razborov, Lower bounds on the size of bounded-depth networks over a complete basis with logical addition.Mathematical Notes of the Academy of Sciences of the USSR 41 (1987), 333–338.
R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity. InProc. ACM Symp. on Theory of Computing, 1987, 77–82.
R. Smolensky, Representations of sets of Boolean functions by commutative rings.Computational complexity 6(3), (1997), 199–208.
J. J. Sylvester, Throughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colors.Philosophical Magazine 34 (1867), 461–475.
I. Wegener,The Complexity of Boolean Functions. John Wiley & Sons, 1987.
A. C. Yao, On ACC and threshold circuits. InProc. IEEE Symp. Found. Comp. Sci., 1990, 619–627.
Author information
Authors and Affiliations
Additional information
Dedicated to the memory of Roman Smolensky
Rights and permissions
About this article
Cite this article
Bruck, J. Reflections on “Representations of sets of Boolean functions by commutative rings” by Roman Smolensky. Comput Complexity 6, 209–212 (1996). https://doi.org/10.1007/BF01294254
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01294254