Skip to search formSkip to main contentSkip to account menu

Randomized algorithm

Known as: Derandomization, Probabilistic computational complexity, Probabilistic-Complexity Theory 
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic. The algorithm typically uses uniformly random bits… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
For an unweighted undirected graph G = (V,E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G′ = (V,H), H ⊂eqE, is… 
Highly Cited
2004
Highly Cited
2004
Although silicon is not an essential nutrient, its application is beneficial for plant growth and development. To evaluate… 
Highly Cited
2001
Highly Cited
2001
The web is now becoming one of the largest information and knowledge repositories. Many large scale search engines (Google, Fast… 
Highly Cited
1996
Highly Cited
1996
Root total nonstructural carbohydrate (TNC) has been studied, but little is known about seasonal trends in proteins and other… 
Highly Cited
1995
Highly Cited
1995
In an effort to make object recognition efficient and accurate enough for applications, the authors have developed three… 
Highly Cited
1976
Highly Cited
1976
amount of fertilizer N utilized by rice, no information is In order to improve the efficiency of fertilizer N utilization by rice…