One-sided versus two-sided error in probabilistic computation
From MaRDI portal
Recommendations
- Computing Probabilities of Type I Error and Type II Error of Sequential Bayesian Procedures for Testing One-Sided Hypotheses
- Learning reliably and with one-sided error
- One-sided error estimates in renewal theory
- One-sided error probabilistic inductive inference and reliable frequency identification
- One-sided versus two-sided stochastic descriptions
- On some upper bounds for the probability of error
- Error-bounded probabilistic computations between MA and AM
- Mathematical Foundations of Computer Science 2003
- Errors estimation and the asymptotic distribution of probabilistic estimates
Cited in
(12)- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
- NL-printable sets and nondeterministic Kolmogorov complexity
- Reconstructive dispersers and hitting set generators
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
- Simplified derandomization of BPP using a hitting set generator
- NL-printable sets and nondeterministic Kolmogorov complexity
- Preserving randomness for adaptive algorithms
- Hitting sets give two-sided derandomization of small space
- Easiness assumptions and hardness tests: Trading time for zero error
- Paradigms for Unconditional Pseudorandom Generators
- Towards free lunch derandomization from necessary assumptions (and OWFs)
- Pseudodistributions that beat all pseudorandom generators
This page was built for publication: One-sided versus two-sided error in probabilistic computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251044)
