Polynomial Time Relatively Computable Triangular Arrays in a Multinomial Setting

arXiv1603.06006MaRDI QIDQ6271645

Patricia Garmirian, Lee J. Stanley, Vladimir Dobric

Publication date: 18 March 2016

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50) Strong limit theorems (60F15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)