Listing 1 - 6 of 6 |
Sort by
|
Choose an application
Computer science --- Science --- Numerical analysis --- Sciences --- Analyse numérique --- Data processing. --- Informatique --- Data processing --- 37.026 --- -Numerical analysis --- -519.6 --- Mathematical analysis --- Natural science --- Science of science --- Didaktiek--grondbeginselen --- Computational mathematics. Numerical analysis. Computer programming --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 37.026 Didaktiek--grondbeginselen --- Analyse numérique --- Natural sciences --- Science - Data processing --- Numerical analysis - Data processing --- -Data processing
Choose an application
Computer programming --- Pascal (Computer program language) --- Science --- Programmed instruction. --- Programmed instruction. --- Data processing --- Programmed instruction.
Choose an application
Prime numbers beckon to the beginner, as the basic notion of primality is accessible even to children. Yet, some of the simplest questions about primes have confounded humankind for millennia. In the new edition of this highly successful book, Richard Crandall and Carl Pomerance have provided updated material on theoretical, computational, and algorithmic fronts. New results discussed include the AKS test for recognizing primes, computational evidence for the Riemann hypothesis, a fast binary algorithm for the greatest common divisor, nonuniform fast Fourier transforms, and more. The authors also list new computational records and survey new developments in the theory of prime numbers, including the magnificent proof that there are arbitrarily long arithmetic progressions of primes, and the final resolution of the Catalan problem. Numerous exercises have been added. Richard Crandall currently holds the title of Apple Distinguished Scientist, having previously been Apple's Chief Cryptographer, the Chief Scientist at NeXT, Inc., and recipient of the Vollum Chair of Science at Reed College. Though he publishes in quantum physics, biology, mathematics, and chemistry, and holds various engineering patents, his primary interest is interdisciplinary scientific computation. Carl Pomerance is the recipient of the Chauvenet and Conant Prizes for expository mathematical writing. He is currently a mathematics professor at Dartmouth College, having previously been at the University of Georgia and Bell Labs. A popular lecturer, he is well known for his research in computational number theory, his efforts having produced important algorithms now in use. From the reviews of the first edition: "Destined to become a definitive textbook conveying the most modern computational ideas about prime numbers and factoring, this book will stand as an excellent reference for this kind of computation, and thus be of interest to both educators and researchers." ^ L'Enseignement Mathématique "...Prime Numbers is a welcome addition to the literature of number theory---comprehensive, up-to-date and written with style." - American Scientist "It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." - Bulletin of the AMS.
Numbers, Prime. --- Numbers, Natural. --- Natural numbers --- Numbers, Whole --- Whole numbers --- Numbers, Rational --- Prime numbers --- Numbers, Natural --- Number theory. --- Number Theory. --- Number study --- Numbers, Theory of --- Algebra --- 511.3 --- Numbers, Prime --- 681.3*F22 --- 511.3 Analytical, additive and other number-theory problems. Diophantine approximations --- Analytical, additive and other number-theory problems. Diophantine approximations --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3}
Choose an application
In this volume we have endeavored to provide a middle ground-hopefully even a bridge-between "theory" and "experiment" in the matter of prime numbers. Of course, we speak of number theory and computer experiment. There are great books on the abstract properties of prime numbers. Each of us working in the field enjoys his or her favorite classics. But the experimental side is relatively new. Even though it can be forcefully put that computer science is by no means young, as there have arguably been four or five computer "revolutions" by now, it is the case that the theoretical underpinnings of prime numbers go back centuries, even millennia. So, we believe that there is room for treatises based on the celebrated classical ideas, yet authored from a modern computational perspective. Design and scope of this book The book combines the essentially complementary areas of expertise of the two authors. (One author (RC) is more the computationalist, the other (CP) more the theorist. ) The opening chapters are in a theoretical vein, even though some explicit algorithms are laid out therein, while heavier algorithmic concentration is evident as the reader moves well into the book. Whether in theoretical or computational writing mode, we have tried to provide the most up-to-date aspects of prime-number study. What we do not do is sound the very bottom of every aspect.
Numbers, Prime. --- Numbers, Prime --- 511.3 --- Prime numbers --- Numbers, Natural --- 511.3 Analytical, additive and other number-theory problems. Diophantine approximations --- Analytical, additive and other number-theory problems. Diophantine approximations --- Number theory. --- Number Theory. --- Number study --- Numbers, Theory of --- Algebra
Choose an application
This book describes an array of management programs and groups them to indicate their primary purpose. It also outlines a process that will enable managers to select the most appropriate management program to meet their immediate and long-term needs. An important feature of this resource is that it can be updated periodically to add new programs and phase out programs no longer relevant. Topics include: a comprehensive description of the most popular management improvement programs and their primary applications to their organizations; the philosophy and principles of these programs and discussions; matching the improvement program with the specific needs in an organization. --
Industrial management. --- Reengineering (Management) --- Performance. --- Competence --- Work --- Business process reengineering --- Re-engineering (Management) --- Management --- Business administration --- Business enterprises --- Business management --- Corporate management --- Corporations --- Industrial administration --- Management, Industrial --- Rationalization of industry --- Scientific management --- Business --- Industrial organization --- Industrial management --- Performance --- E-books
Choose an application
Business logistics. --- Physical distribution of goods --- Marketing channels --- Management. --- Logistique (gestion) --- Business logistics --- Management
Listing 1 - 6 of 6 |
Sort by
|