A Hierarchy Theorem for Interactive Proofs of Proximity. Gur, T. & Rothblum, R. D. In 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, volume 67, of LIPIcs, pages 39:1–39:43, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
A Hierarchy Theorem for Interactive Proofs of Proximity [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/innovations/GurR17,
  author    = {Tom Gur and
               Ron D. Rothblum},
  editor    = {Christos H. Papadimitriou},
  title     = {A Hierarchy Theorem for Interactive Proofs of Proximity},
  booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
               2017, January 9-11, 2017, Berkeley, CA, {USA}},
  series    = {LIPIcs},
  volume    = {67},
  pages     = {39:1--39:43},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2017.39},
  doi       = {10.4230/LIPIcs.ITCS.2017.39},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/innovations/GurR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0