Two lower bounds for branching programs

Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán. Two lower bounds for branching programs. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA. pages 30-38, ACM, 1986.

@inproceedings{AjtaiBHKPRST86,
  title = {Two lower bounds for branching programs},
  author = {Miklós Ajtai and László Babai and Péter Hajnal and János Komlós and Pavel Pudlák and Vojtech Rödl and Endre Szemerédi and György Turán},
  year = {1986},
  researchr = {https://researchr.org/publication/AjtaiBHKPRST86},
  cites = {0},
  citedby = {0},
  pages = {30-38},
  booktitle = {Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA},
  publisher = {ACM},
}