Pages that link to "Item:Q5757455"
From MaRDI portal
The following pages link to Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455):
Displaying 35 items.
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- On axis-parallel tests for tensor product codes (Q5002642) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5002790) (← links)
- (Q5002796) (← links)
- Explicit strong LTCs with inverse poly-log rate and constant soundness (Q5009557) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- (Q5090371) (← links)
- (Q5090398) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- (Q5090443) (← links)
- (Q5093398) (← links)
- Bridging a Small Gap in the Gap Amplification of Assignment Testers (Q5098766) (← links)
- On axis-parallel tests for tensor product codes (Q5140839) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- (Q5743490) (← links)
- (Q5857610) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5885585) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
- Robustly self-ordered graphs: constructions and applications to property testing (Q6562699) (← links)
- Testing distributions of huge objects (Q6566597) (← links)
- Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)
