A revised version of A recursion algorithm for finding pure admissible decision functions in statistical decisions
Our rough guess is there are 2,500 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 10 minutes to read. With a half hour per day, this will take 1 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Publication
1974 - Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Industrial Administration, Purdue University, West Lafayette, Ind, Indiana
Language
English
Word Count
2,500 words, Guess
Page Count
10 pages
Identifiers
- Library of Congress Control Number74623912
- Open LibraryOL5171852M
Classifications
- DDC658/.001/9 s
- DDC658.4/03
- LCCHD6483 .P8 no. 476
and 1 more
- LCCHD69.D4 .P8 no. 476
Alternate Titles
- Recursion algorithm for finding pure admissible decision functions in statistical decisions.
Subjects
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!