4 citations · 7 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
Non-Signaling Proofs with Provers are in PSPACE
Dhiraj Holden, Yael Kalai
Non-signaling proofs, motivated by quantum computation, have found applications in cryptography and hardness of approximation. An important open problem is characterizing the power…
cs.CC2019
Doubly-Efficient Pseudo-Deterministic Proofs
Michel Goemans, Shafi Goldwasser, Dhiraj Holden
In [20] Goldwasser, Grossman and Holden introduced pseudo-deterministic interactive proofs for search problems where a powerful prover can convince a probabilistic polynomial time…