Abstract: It is known (Boppana et a;., 1987) that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. (1992 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback