Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy

Harry Buhrman, Steven Homer. Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. In R. K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings. Volume 652 of Lecture Notes in Computer Science, pages 116-127, Springer, 1992.

@inproceedings{BuhrmanH92,
  title = {Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy},
  author = {Harry Buhrman and Steven Homer},
  year = {1992},
  researchr = {https://researchr.org/publication/BuhrmanH92},
  cites = {0},
  citedby = {0},
  pages = {116-127},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
  editor = {R. K. Shyamasundar},
  volume = {652},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-56287-7},
}