Pages that link to "Item:Q1199875"
From MaRDI portal
The following pages link to Highly resilient correctors for polynomials (Q1199875):
Displaying 29 items.
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes (Q391770) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Power error locating pairs (Q782853) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- Generalized Gabidulin codes over fields of any characteristic (Q1650439) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Self-correcting polynomial programs (Q1916988) (← links)
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average (Q2240857) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Addendum to ``Scalable secure storage when half the system is faulty'' [inform. comput. 174 (2)(2002) 203-213] (Q2373880) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks (Q2700388) (← links)
- Optimal Rate List Decoding via Derivative Codes (Q3088129) (← links)
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451) (← links)
- (Q3682391) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Self-correcting for function fields of finite transcendental degree (Q4645210) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5090443) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- (Q5857610) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)