Pages that link to "Item:Q1906841"
From MaRDI portal
The following pages link to Efficient checking of polynomials and proofs and the hardness of approximation problems (Q1906841):
Displayed 12 items.
- A novel elementary construction of matching vectors (Q436582) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Algebraic testing and weight distributions of codes. (Q1874387) (← links)
- Self-correcting polynomial programs (Q1916988) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5857610) (← links)