The lower bound theory for circuits received an additional boost through algebraic techniques (in combination with probabilistic techniques) that go back to Razborov and Smolensky.
Unable to display preview. Download preview PDF.
- R. Smolensky: Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the 19th Annual Symposium on Theory of Computing, ACM, 1979, 77-82.Google Scholar
- N. Alon, J.H. Spencer: The Probabilistic Method, Wiley, 1992, Chapter 11.Google Scholar
- R. Beigel: The polynomial method in circuit complexity, Structure in Complexity Theory Conference, IEEE, 1993.Google Scholar
- M.L. Minsky, S.A. Papert: Perceptrons, MIT Press, 1969.Google Scholar
© Springer-Verlag Berlin Heidelberg 1998