From randomizing polynomials to parallel algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1304350
- Randomization and the parallel solution of linear algebra problems
- scientific article; zbMATH DE number 176073
- Publication:4942231
- scientific article; zbMATH DE number 4047072
- Parallelism in randomized incremental algorithms
- Robust parallel computations through randomization
- Random pseudo-polynomial algorithms for some combinatorial programming problems
Cites work
- Asymptotic calibration
- Dimension in Complexity Classes
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- scientific article; zbMATH DE number 3227613 (Why is no real title available?)
- The Complexity of Forecast Testing
- The dimensions of individual strings and sequences
- THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES
- The reproducible properties of correct forecasts
- The Well-Calibrated Bayesian
- Universal prediction
Cited in
(5)- Computationally private randomizing polynomials and their applications
- Statistical randomized encodings: a complexity theoretic view
- The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: From randomizing polynomials to parallel algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826046)