Pages that link to "Item:Q3990791"

The following pages link to Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs (Q3990791):

Displaying 42 items.

• Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
• On quasilinear-time complexity theory (Q672330) (← links)
• Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
• On rigid matrices and \(U\)-polynomials (Q901935) (← links)
• Defaults and relevance in model-based reasoning (Q1127354) (← links)
• Attribute-efficient learning in query and mistake-bound models (Q1271616) (← links)
• Generalized hashing and parent-identifying codes. (Q1417959) (← links)
• Improved algorithms via approximations of probability distributions (Q1582012) (← links)
• On the decisional complexity of problems over the reals (Q1854429) (← links)
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
• On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
• Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← links)
• Shift lifts preserving Ramanujan property (Q2361560) (← links)
• The cell probe complexity of succinct data structures (Q2373728) (← links)
• Low-degree test with polynomially small error (Q2410685) (← links)
• A coding scheme that increases the code rate (Q2514072) (← links)
• Reasoning with models (Q2676579) (← links)
• Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
• A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
• Basic Facts about Expander Graphs (Q3088196) (← links)
• Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
• Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Random Cayley graphs and expanders (Q4286294) (← links)
• Constructions of permutation arrays for certain scheduling cost measures (Q4322473) (← links)
• (Q5002692) (← links)
• MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
• The complexity of error-correcting codes (Q5055921) (← links)
• Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
• (Q5091136) (← links)
• Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
• Spectral expansion of random sum complexes (Q5131449) (← links)
• Distributed Corruption Detection in Networks (Q5140835) (← links)
• A combination of testability and decodability by tensor products (Q5252263) (← links)
• List-Decoding with Double Samplers (Q5856152) (← links)
• Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
• A new formula for the minimum distance of an expander code (Q5884135) (← links)
• (Q6084350) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
• Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)
• Pseudorandom error-correcting codes (Q6652990) (← links)