scientific article; zbMATH DE number 1775407
From MaRDI portal
Publication:4542540
zbMATH Open1027.68608MaRDI QIDQ4542540FDOQ4542540
Authors: Dima Grigoriev 
Publication date: 1 August 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
- The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- Improved lower bounds on the randomized complexity of graph properties
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Complexity lower bounds for randomized computation trees over zero characteristic fields
- Data Structures Lower Bounds and Popular Conjectures
- Lower space bounds for randomized computation
- Title not available (Why is that?)
- Complexity bounds for zero-test algorithms
- The value of help bits in randomized and average-case complexity
- Title not available (Why is that?)
- On lower bounds for the time of computation
- On the complexity of finite random functions
- Uniform Derandomization from Pathetic Lower Bounds
- On randomized sketching algorithms and the Tracy-Widom law
- The randomized complexity of initial value problems
- A tight lower bound for computing the diameter of a 3D convex polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties
- Complexity lower bounds for approximation algebraic computation trees
- Uniform derandomization from pathetic lower bounds
- Lower Bounds for Coin-Weighing Problems
- A lower bound for randomized list update algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542540)
