Pages that link to "Item:Q1107314"

The following pages link to Expanders, randomness, or time versus space (Q1107314):

Displaying 18 items.

• Pseudorandom generators for space-bounded computation (Q1204523) (← links)
• Extracting randomness: A survey and new constructions (Q1305929) (← links)
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
• On the complexity of approximating the VC dimension. (Q1872731) (← links)
• Simulating BPP using a general weak random source (Q1923854) (← links)
• Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
• Realistic analysis of some randomized algorithms (Q2277019) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Computation of best possible low degree expanders (Q2462391) (← links)
• Extractors from Reed-Muller codes (Q2496317) (← links)
• Quasi‐random classes of hypergraphs (Q3970905) (← links)
• Construction of expanders and superconcentrators using Kolmogorov complexity (Q4500485) (← links)
• Extractors for weak random sources and their applications (Q5054851) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
• Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
• Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
• Constructions of strongly regular Cayley graphs derived from weakly regular bent functions (Q6204333) (← links)