Search results
From MaRDI portal
- 2014-11-25 Paper The PCP theorem by gap amplification 2014-11-25 Paper Composition of Low-Error 2-Query PCPs Using Decodable PCPs 2014-07-25 Paper Composition...10 bytes (17 words) - 14:15, 12 December 2023
- 2-Query PCPs Using Decodable PCPs 2014-04-11 Paper An invariance principle for polytopes 2014-02-17 Paper Composition of Low-Error 2-Query PCPs Using Decodable...10 bytes (16 words) - 10:00, 25 September 2023
- data 2010-08-16 Paper Simple PCPs with poly-log rate and query complexity 2010-08-16 Paper Robust pcps of proximity, shorter pcps and applications to coding...10 bytes (17 words) - 05:40, 9 December 2023
- Random Oracle Model 2011-08-12 Paper PCPs and the Hardness of Generating Private Synthetic Data 2011-05-19 Paper Are PCPs inherent in efficient arguments?...10 bytes (18 words) - 05:40, 9 December 2023
- tests and short PCPs via epsilon-biased sets 2010-08-16 Paper Simple PCPs with poly-log rate and query complexity 2010-08-16 Paper Robust pcps of proximity...10 bytes (18 words) - 03:32, 25 September 2023
- Paper Computational Integrity with a Public Random String from Quasi-Linear PCPs 2017-06-23 Paper Deterministic Extractors for Additive Sources 2017-05-19...10 bytes (16 words) - 21:34, 9 December 2023
- factorization mechanisms in local and central differential privacy 2021-01-19 Paper PCPs and the hardness of generating synthetic data 2020-11-06 Paper Fingerprinting...10 bytes (18 words) - 04:45, 12 December 2023
- Paper Combinatorial PCPs with short proofs 2016-03-21 Paper Toward better formula lower bounds 2015-06-26 Paper Combinatorial PCPs with efficient verifiers...10 bytes (16 words) - 16:49, 24 September 2023
- Public Random String from Quasi-Linear PCPs 2017-06-23 Paper Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs 2016-04-08 Paper Cluster Computing...10 bytes (16 words) - 11:46, 6 October 2023
- efficient queries in PCPs for NP and improved approximation hardness of maximum CSP 2009-03-04 Paper STACS 2005 2005-12-02 Paper Three‐query PCPs with perfect...10 bytes (16 words) - 14:29, 24 September 2023
- Publication Type https://portal.mardi4nfdi.de/entity/Q6107255 2023-07-03 Paper ZK-PCPs from leakage-resilient secret sharing 2022-08-01 Paper The price of active...10 bytes (16 words) - 18:02, 24 September 2023
- Publication Date of Publication Type PCPS 2020-01-15 Software...10 bytes (14 words) - 17:40, 24 September 2023
- Type Computational Integrity with a Public Random String from Quasi-Linear PCPs 2017-06-23 Paper...10 bytes (16 words) - 22:22, 27 December 2023
- Type Computational Integrity with a Public Random String from Quasi-Linear PCPs 2017-06-23 Paper...10 bytes (16 words) - 22:22, 27 December 2023
- https://portal.mardi4nfdi.de/entity/Q5875692 2023-02-03 Paper Smooth and strong PCPs 2021-06-04 Paper...10 bytes (16 words) - 22:58, 24 September 2023
- Secure Computation 2014-02-18 Paper Languages with Efficient Zero-Knowledge PCPs are in SZK 2013-03-18 Paper The Curious Case of Non-Interactive Commitments...10 bytes (16 words) - 10:44, 24 September 2023
- and PCPs 2014-11-25 Paper A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume 2014-09-26 Paper A PCP characterization...10 bytes (17 words) - 16:08, 8 December 2023
- Grassmann graphs 2017-08-17 Paper Towards an optimal query efficient PCP? 2017-05-16 Paper PCP characterizations of NP 2016-09-29 Paper Approximating the Influence...10 bytes (17 words) - 16:08, 8 December 2023
- Publication Date of Publication Type Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity 2018-08-02 Paper A new family of locally correctable...10 bytes (16 words) - 17:15, 6 October 2023
- Type Computational Integrity with a Public Random String from Quasi-Linear PCPs 2017-06-23 Paper https://portal.mardi4nfdi.de/entity/Q4420601 2003-08-18...10 bytes (16 words) - 20:44, 26 December 2023
