Randomized algorithms use random bits for expected polynomial time
Image: Yakuzakorat, CC BY 4.0, via Wikimedia Commons
Randomized algorithm
Randomized algorithms use random bits for expected polynomial time
Randomized algorithms incorporate randomness to improve average-case performance. They often use uniformly random bits as an auxiliary input to guide their behavior, aiming for good performance across all possible random choices. This randomness helps in achieving expected polynomial time for solving problems.
Example
Quicksort is a Las Vegas algorithm that uses random bits to select pivot elements, aiming for expected polynomial time complexity.
Understanding the use of random bits in randomized algorithms is crucial for designing efficient algorithms that perform well on average, even though they may not guarantee the best-case performance in every scenario.
Related concepts
Shor's algorithm
Shor's algorithm factors integers in polynomial time on a quantum computer
Kolmogorov complexity
Kolmogorov complexity is uncomputable
Rate-distortion theory: minimum bits to represent data within distortion D
Rate-distortion theory: minimum bits to represent data within distortion D = R(D)
the Johnson-Lindenstrauss lemma says
Random projection reduces dimensionality while approximately preserving pairwise distances
Computational complexity of matrix multiplication
O(n³) naive matrix multiplication
random projection to O(log n/ε²) dimensions preserves pairwise distances within 1±ε
Random projection reduces dimensionality while preserving pairwise distances within ε² due to the Johnson-Lindenstrauss lemma
One email a day: 5 concepts + the 5 stories that matter →
Swipe through 100 ML concepts daily
Open TickerNews