A Probabilistic-Time Hierarchy Theorem for Slightly Non-uniform Algorithms

Boaz Barak. A Probabilistic-Time Hierarchy Theorem for Slightly Non-uniform Algorithms. In José D. P. Rolim, Salil P. Vadhan, editors, Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings. Volume 2483 of Lecture Notes in Computer Science, pages 194-208, Springer, 2002. [doi]

@inproceedings{Barak02:0,
  title = {A Probabilistic-Time Hierarchy Theorem for  Slightly Non-uniform  Algorithms},
  author = {Boaz Barak},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2483/24830194.htm},
  researchr = {https://researchr.org/publication/Barak02%3A0},
  cites = {0},
  citedby = {0},
  pages = {194-208},
  booktitle = {Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
  editor = {José D. P. Rolim and Salil P. Vadhan},
  volume = {2483},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44147-6},
}