Probability Verifiable (pcp) System

Computational complexity theory is the computer of a vital area. It contains not only the independence and integrity of a wide range of theories, They are also related to many other computer and application of mathematics have a major impact. In 1994, the S.Arora Princeton University, in his doctoral dissertation. the Probabilistic Checking of Proofs (PCP) system, the NP reached new features using this method comes from the interactive system proves that the concept of expansion the use of linear algebra and mathematical coding theory proven skills to solve many computational complexity of the problem. Therefore, many domestic and foreign experts and scholars are in it for research. On this premise, the paper on the research and compiling, and testing of some of the SR system work.