Answer by D.W. for Problems in P with provably faster randomized algorithms
There are many problems where we know of an efficient randomized algorithm, and we don't know of any deterministic algorithm that we can prove is efficient. However, this may reflect shortcomings in...
View ArticleAnswer by Raphael for Problems in P with provably faster randomized algorithms
Investigating the worst-case is meaningless for randomised algorithms. Not only will the worst-case runtime often be infinite but also they can not outperform deterministic algorithms in that...
View ArticleAnswer by rizwanhudda for Problems in P with provably faster randomized...
Polynomial identity testing admits a randomised polynomial time algorithm (see theSchwartz-Zippel lemma), and we currently don't have a deterministic polynomial time or even a sub-exponential time...
View ArticleProblems in P with provably faster randomized algorithms
Are there any problems in $\mathsf{P}$ that have randomized algorithms beating lower bounds on deterministic algorithms? More concretely, do we know any $k$ for which $\mathsf{DTIME}(n^k) \subsetneq...
View Article
