A note on PCP vs. MIP (Q1350618): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/ipl/Ta-Shma96, #quickstatements; #temporary_batch_1731483406851 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00043-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2160227905 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4230321 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the power of multi-prover interactive protocols / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/ipl/Ta-Shma96 / rank | |||
Normal rank |
Latest revision as of 09:51, 13 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on PCP vs. MIP |
scientific article |
Statements
A note on PCP vs. MIP (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Complexity
0 references
Interactive proof system
0 references