scientific article; zbMATH DE number 3930719
From MaRDI portal
Publication:3703583
[For the entire collection see Zbl 0547.00052.] The objective of the paper is to provide a fairly complete list of the existing English literature about algorithms equipped with: Coin tossing state; exception of methods for global continuous optimization and of applications to cryptography. The contents of the paper are: Surveys; theoretical computer science works; decision problems; speed-up of an already efficient algorithm; discrete optimization problems. The paper is considered to be a very good reference to research being done in the corresponding areas.
Recommendations
Cited in
(11)- Random pseudo-polynomial algorithms for some combinatorial programming problems
- A fast randomized algorithm for partitioning a graph into paths of fixed length
- A method for obtaining randomized algorithms with small tail probabilities
- Randomized algorithms for the majority problem
- Randomized Algorithms for Matrices and Data
- Randomized algorithms and pseudorandom numbers
- scientific article; zbMATH DE number 3843133 (Why is no real title available?)
- scientific article; zbMATH DE number 4099042 (Why is no real title available?)
- scientific article; zbMATH DE number 176073 (Why is no real title available?)
- Probabilistic Algorithmic Randomness
- scientific article; zbMATH DE number 5264766 (Why is no real title available?)
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 Q3703583)