29 citations · 30 across the 5 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024
RE-completeness of entangled constraint satisfaction problems
Eric Culf, Kieran Mastel
Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. S…
quant-ph2024
Two prover perfect zero knowledge for MIP*
Kieran Mastel, William Slofstra
The recent MIP*=RE theorem of Ji, Natarajan, Vidick, Wright, and Yuen shows that the complexity class MIP* of multiprover proof systems with entangled provers contains all recursiv…