% The Chicago Journal of Theoretical Computer Science, Volume 1995, Article 2
% Bibliography

@string{articleid="{\section*{}
  \textbf{References for CJTCS Volume 1995, Article 2}}"
}

@preamble{articleid}

@inproceedings{cj95-02-1,
  author={James Aspnes and Richard Beigel and Merrick L. Furst and Steven
           Rudich},
  title={The expressive power of voting polynomials},
  year={1991},
  pages={402--409},
  booktitle={Proceedings of the 23rd ACM Symposium on Theory of
		  Computation},
  organization={Association for Computing Machinery}
}

@article{cj95-02-2,
  author={Mikl{\'o}s Ajtai},
  title={\(\sum^1_1\) formulae on finite structures},
  year={1983},
  journal={Annals of Pure and Applied Logic},
  publisher={Elsevier North-Holland},
  volume={24},
  pages={1--48}
}

@article{cj95-02-3,
  author={David A. Mix Barrington and Richard Beigel and Steven Rudich},
  title={Representing {B}oolean functions as polynomials modulo
         composite numbers},
  journal={Computational Complexity},
  publisher={Birkh{\"a}user},
  address={Basel},
  year={1994},
  volume={4},
  pages={367--382},
  note={Also appeared in \emph{Proceedings of the 24th ACM Symposium
        on Theory of Computing}, 1992}
}

@inproceedings{cj95-02-4,
  author={Richard Beigel},
  title={The polynomial method in circuit complexity},
  year={1993},
  pages={82--95},
  booktitle={Proceedings of the 8th Annual Conference on Structure
		  in Complexity Theory},
  publisher={IEEE Computer Society Press},
  organization={Institute of Electrical and Electronics Engineers}
}

@article{cj95-02-5,
  author={L{\'a}szl{\'o} Babai and Noam Nisan and M{\'a}ri{\'o} Szegedy},
  title={Multiparty Protocols, Pseudorandom Generators for Logspace,
		  and Time-Space Trade-Offs},
  year={1992},
  journal={Journal of Computer and System Sciences},
  publisher={Academic Press},
  volume={45},
  pages={204--232}
}

@inproceedings{cj95-02-6,
  author={Ashok K. Chandra and Merrick L. Furst and Richard J. Lipton},
  title={Multi-Party Protocols},
  year={1983},
  pages={94--99},
  booktitle={Proceedings 15th ACM Symposium on Theory of Computing},
  organization={Association for Computing Machinery}
}

@article{cj95-02-7,
  author={Merrick L. Furst and James B. Saxe and Michael Sipser},
  title={Parity, circuits and the polynomial time hierarchy},
  year={1984},
  journal={Mathematical Systems Theory},
  volume={17},
  pages={13--27}
}

@inproceedings{cj95-02-8,
  author={Mikael Goldmann and Johann H{\aa}stad},
  title={On the Power of the Small-Depth Threshold Circuits},
  year={1990},
  pages={610--618},
  booktitle={Proceedings of the 31st IEEE Symposium on Foundations of
		  Computer Science},
  organization={Institute of Electrical and Electronics Engineers}
}

@article{cj95-02-9,
  author={Noam Nisan and M{\'a}ri{\'o} Szegedy},
  title={On the degree of {B}oolean functions as real polynomials},
  year={1994},
  journal={Computational Complexity},
  publisher={Birkh{\"a}user},
  address={Basel},
  volume={4},
  pages={462--467},
  note={Also apeared in \emph{Proceedings of the 24th ACM Symposium on
		  Theory of Computing}, 1992.}
}

@article{cj95-02-10,
  author={Alexander Razborov},
  title={Lower bounds for the size of circuits of bounded depth with basis
          ({AND}, {XOR})},
  year={1987},
  journal={Mathematical Notes of the Academy of Science of the USSR},
  volume={41},
  pages={333--338},
  number={4}
}

@article{cj95-02-11,
  author={Alexander Razborov and Avi Wigderson},
  title={\(n^{\Omega(\log n)}\) Lower Bounds on the Size of Depth-3
		  Threshold Circuits with {AND} Gates at the Bottom},
  month={April},
  year={1993},
  journal={Information Processing Letters},
  publisher={Elsevier North-Holland},
  volume={45},
  number={6},
  pages={303--307},
}

@inproceedings{cj95-02-12,
  author={Roman Smolensky},
  title={Algebraic Methods in the theory of lower bounds for {B}oolean
          circuit complexity},
  year={1987},
  pages={77--82},
  booktitle={Proceedings of the 19th ACM Symposium on Theory of
		  Computing},
  organization={Association for Computing Machinery}
}

@inproceedings{cj95-02-13,
  author={G{\'a}bor Tardos and David A. Mix Barrington},
  title={A Lower Bound on the {MOD} 6 Degree of the {OR} Function},
  year={1995},
  pages={52--56},
  booktitle={Proceedings of the 3rd Israel Symosium on the Theory
             of Computing and Systems}
}