Stated broadly, the ones that seem to come up the most are: (1) Can we make the current proof more algebraic?
Statement
Stated broadly, the ones that seem to come up the most are: (1) Can we make the current proof more algebraic? (2) Can we make an explicit counterexample to the CEP? (3) Are there similar types of results we should look for? (4) Can we make a non-hyperlinear group? The provers’ actions in such a protocol can be described by the probability p(a, b|x, y) that the provers output a and b on inputs x and y. The collection p = {p(a, b|x, y) : a, b, x, y \in A\alpha \times A\alpha \times X\alpha \times X\alpha } is called a correlation. The probability that the verifier accepts on correlation p is X \omega(G\alpha , p) = \pi\alpha (x, y)V (a, b|x, y)p(a, b|x, y). a,b,x,y
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.