Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits

Todd Ebert, Wolfgang Merkle. Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 221-233, Springer, 2002. [doi]

@inproceedings{EbertM02,
  title = {Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits},
  author = {Todd Ebert and Wolfgang Merkle},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2420/24200221.htm},
  researchr = {https://researchr.org/publication/EbertM02},
  cites = {0},
  citedby = {0},
  pages = {221-233},
  booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
  editor = {Krzysztof Diks and Wojciech Rytter},
  volume = {2420},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44040-2},
}