Comprised of 17 chapters, this book begins by considering some combinatorial problems studied experimentally on computing machines. The discussion then turns to experiments on optimal coefficients; a distribution problem in finite sets; and the statistical interdependence of pseudo-random numbers generated by the linear congruential method. Subsequent chapters deal with lattice structure and reduced bases of random vectors generated by linear recurrences; modulo optimization problems and integer linear programming; equivalent forms of zero-one programs; and number theoretic foundations of finite precision arithmetic.
This monograph will be of interest to students and practitioners in the field of applied mathematics.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.