The following pages link to (Q202085):
Displaying 50 items.
- Kakeya-type sets in finite vector spaces (Q644691) (← links)
- Queuing with future information (Q744387) (← links)
- An improved lower bound on the size of Kakeya sets over finite fields (Q841571) (← links)
- Probabilistic verification of proofs (Q1126840) (← links)
- Highly resilient correctors for polynomials (Q1199875) (← links)
- On-line algorithms for locating checkpoints (Q1312186) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- (Q1386375) (redirect page) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- Random walks with ``back buttons'' (Q1872455) (← links)
- Efficient checking of polynomials and proofs and the hardness of approximation problems (Q1906841) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- Improved low-degree testing and its applications (Q2494418) (← links)
- The Approximability of Constraint Satisfaction Problems (Q2706139) (← links)
- Learning Polynomials with Queries: The Highly Noisy Case (Q2706184) (← links)
- Complexity Classifications of Boolean Constraint Satisfaction Problems (Q2723175) (← links)
- (Q2753940) (← links)
- (Q2762515) (← links)
- The minimum latency problem (Q2817608) (← links)
- Improved non-approximability results (Q2817610) (← links)
- Chinese remaindering with errors (Q2819549) (← links)
- Pseudorandom generators without the XOR Lemma (extended abstract) (Q2819586) (← links)
- Optimal Testing of Multivariate Polynomials over Small Prime Fields (Q2840981) (← links)
- Absolutely Sound Testing of Lifted Codes (Q2851893) (← links)
- (Q2941633) (← links)
- Adversarial queuing theory (Q2947002) (← links)
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165) (← links)
- List decoding group homomorphisms between supersolvable groups (Q2969659) (← links)
- New affine-invariant codes from lifting (Q2986899) (← links)
- Communication with Imperfectly Shared Randomness (Q2989037) (← links)
- (Q3002831) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- From Logarithmic Advice to Single-Bit Advice (Q3088181) (← links)
- Quick and Dirty Refereeing? (Q3101374) (← links)
- (Q3128902) (← links)
- Priority encoding transmission (Q3129461) (← links)
- Linearity testing in characteristic two (Q3129465) (← links)
- Hardness of Approximate Hypergraph Coloring (Q3149889) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- Private information retrieval (Q3158526) (← links)
- A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes (Q3167433) (← links)
- (Q3191595) (← links)
- List decoding algorithms for certain concatenated codes (Q3191984) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)
