Pages that link to "Item:Q4601820"
From MaRDI portal
The following pages link to Strong locally testable codes with relaxed local decoders (Q4601820):
Displaying 17 items.
- An adaptivity hierarchy theorem for property testing (Q1630385) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Local Decoding and Testing for Homomorphisms (Q3595384) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- (Q5002790) (← links)
- Explicit strong LTCs with inverse poly-log rate and constant soundness (Q5009557) (← links)
- Every Set in P Is Strongly Testable Under a Suitable Encoding (Q5090404) (← links)
- Locally Testable Codes Require Redundant Testers (Q5390594) (← links)
- Robust locally testable codes and products of codes (Q5486320) (← links)
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity (Q5885585) (← links)