A computationally motivated definition of parametric estimation and its applications to the Gaussian distribution
DOI10.1007/s00493-005-0028-4zbMath1095.68033MaRDI QIDQ2568500
Leonard J. Schulman, Vijay V. Vazirani
Publication date: 27 June 2006
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-005-0028-4
fully polynomial randomized approximation scheme; average matching size in a given graph; estimating algorithms; estimator optimality in probability; estimator optimality in variance; general penalty functions; multidimensional spherically symmetric Gaussians; theory of parametric estimation
62F25: Parametric tolerance and confidence regions
68Q25: Analysis of algorithms and problem complexity
68W25: Approximation algorithms
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68W20: Randomized algorithms
Related Items