On the Pseudo-Deterministic Query Complexity of NP Search Problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Shafi Goldwasser' in GoogleThis author has not been identified. Look up 'Russell Impagliazzo' in GoogleThis author has not been identified. Look up 'Toniann Pitassi' in GoogleThis author has not been identified. Look up 'Rahul Santhanam' in Google

runs on WebDSL