Pages that link to "Item:Q3579213"
From MaRDI portal
The following pages link to Algorithmic derandomization via complexity theory (Q3579213):
Displaying 15 items.
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- Deterministic discrepancy minimization (Q2017871) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- A polynomial time approximation scheme for computing the supremum of Gaussian processes (Q2341621) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- An elementary proof of a theorem of Johnson and Lindenstrauss (Q4798181) (← links)
- Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set (Q4972690) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)
