|
|
(2 intermediate revisions by 2 users not shown) |
| Property / MaRDI profile type |
| | |
| Property / MaRDI profile type: MaRDI publication profile / rank |
| | Normal rank |
| Property / full work available at URL |
| | |
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_6 / rank |
| | Normal rank |
| Property / OpenAlex ID |
| | |
| Property / OpenAlex ID: W189554415 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Upper bound on the communication complexity of private information retrieval / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Proof verification and the hardness of approximation problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Probabilistic checking of proofs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4252728 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / 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: Improved non-approximability results / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Locally Testable Codes Require Redundant Testers / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some 3CNF properties are hard to test / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Short PCPs with Polylog Query Complexity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Self-testing/correcting with applications to numerical problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4542539 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Private information retrieval / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The PCP theorem by gap amplification / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Composition of Low-Error 2-Query PCPs Using Decodable PCPs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: 3-query locally decodable codes of subexponential length / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Fast approximate PCPs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Interactive proofs and the hardness of approximating cliques / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5682225 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the power of multi-prover interactive protocols / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Short Locally Testable Codes and Proofs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Computational Complexity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Property testing and its connection to learning and approximation / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Lower bounds for linear locally decodable codes and private information retrieval / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Locally testable codes and PCPs of almost-linear length / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Small PCPs with low query complexity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some optimal inapproximability results / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the efficiency of local decoding procedures for error-correcting codes / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Fully parallelized multi-prover protocols for NEXP-time / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Algebraic methods for interactive proof systems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Combinatorial Construction of Locally Testable Codes / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Combinatorial PCPs with Efficient Verifiers / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Computationally Sound Proofs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Nearly-linear size holographic proofs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A Parallel Repetition Theorem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4938652 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3549622 / rank |
| | Normal rank |