Algorithmical complexity of some statistical decision processes. II

Previous | Up | Next

Article

Algorithmical complexity of some statistical decision processes. II. (English). Kybernetika, vol. 16 (1980), issue 4, pp. (357)-376

MSC: 62C05, 62C10, 62C12, 68C25, 68Q25, 90A05 | MR 0591964 | Zbl 0446.68029

References:

[1] A. Wald: Statistical Decision Functions. John Wiley, New York 1950. MR 0036976 | Zbl 0040.36402

[2] M. Davis: Computability and Unsolvability. Mc Graw-Hill, New York-Toronto-London 1958. MR 0124208 | Zbl 0080.00902

[3] A. V. Aho J. E. Hoptcroft J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. 1974.

[4] I. Kramosil: Statistical Approach to Theorem Proving. Supplement to Kybernetika 15 (1979), 1-6, 1-97. MR 0562376

Partner of