On the Pseudo-Deterministic Query Complexity of NP Search Problems

Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam. On the Pseudo-Deterministic Query Complexity of NP Search Problems. In Valentine Kabanets, editor, 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference). Volume 200 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{GoldwasserIPS21,
  title = {On the Pseudo-Deterministic Query Complexity of NP Search Problems},
  author = {Shafi Goldwasser and Russell Impagliazzo and Toniann Pitassi and Rahul Santhanam},
  year = {2021},
  doi = {10.4230/LIPIcs.CCC.2021.36},
  url = {https://doi.org/10.4230/LIPIcs.CCC.2021.36},
  researchr = {https://researchr.org/publication/GoldwasserIPS21},
  cites = {0},
  citedby = {0},
  booktitle = {36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)},
  editor = {Valentine Kabanets},
  volume = {200},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-193-1},
}