Pages that link to "Item:Q3579250"

The following pages link to Randomness conductors and constant-degree lossless expanders (Q3579250):

Displaying 38 items.

• Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
• Symmetric LDPC codes and local testing (Q519972) (← links)
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
• A generalized Alon-Boppana bound and weak Ramanujan graphs (Q726663) (← links)
• Better short-seed quantum-proof extractors (Q764353) (← links)
• Rainbow paths (Q965956) (← links)
• Local expanders (Q1653336) (← links)
• Expander \(\ell_0\)-decoding (Q1669068) (← links)
• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
• The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
• The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
• Expander-based cryptography meets natural proofs (Q2125080) (← links)
• Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• Partition expanders (Q2363958) (← links)
• Deterministic multi-channel information exchange (Q2396723) (← links)
• Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
• Low-degree test with polynomially small error (Q2410685) (← links)
• An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs (Q2685613) (← links)
• Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
• The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms (Q3007623) (← links)
• An Introduction to Randomness Extractors (Q3012907) (← links)
• Minimal selectors and fault tolerant networks (Q3057156) (← links)
• Quantum Locally Testable Codes (Q3449558) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Key Agreement from Close Secrets over Unsecured Channels (Q3627436) (← links)
• Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
• (Q5090388) (← links)
• Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
• Certifiably Pseudorandom Financial Derivatives (Q5244399) (← links)
• Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
• Nonlinear approximation spaces for inverse problems (Q5873933) (← links)
• A new formula for the minimum distance of an expander code (Q5884135) (← links)
• Optimal deterministic group testing algorithms to estimate the number of defectives (Q5918294) (← links)
• Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
• Simple Codes and Sparse Recovery with Fast Decoding (Q6101016) (← links)