Interactive PCP

    Electronic Colloquium on Computational Complexity, Volume 14, Issue 031, 2007, Pages 536-547.

    Cited by: 46|Bibtex|Views2|Links

    Abstract:

    A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with very low communication complexity, then for some NP languages, one can construct PCPs that are significantly shorter than the known PCPs (without the additional in...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments