Enlarged and updated for its second edition, this highly readable book addresses four fundamental problems: the number of primes below a given limit, the approximate number of primes, the recognition of primes and the factorization of large numbers....Lasīt vairāk
(Izdošanas datums: 02-Aug-2010, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817649678)
Published in honor of his 70th birthday, this volume explores and celebrates the work of G.W. (Pete) Stewart, a world-renowned expert in computational linear algebra. It is widely accepted that Stewart is the successor to James Wilkinson, the first g...Lasīt vairāk
Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefčvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres
(Izdošanas datums: 01-Dec-2009, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817647049)
Šī grāmata vairs netiek publicēta. Jums tiks paziņota lietotas grāmatas cena
This handbook aims to provide a complete overview of modern floating-point arithmetic, including a detailed treatment of the newly revised (IEEE 754-2008) standard for floating-point arithmetic. Presented throughout are algorithms for implementing fl...Lasīt vairāk
(Izdošanas datums: 17-Nov-2009, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817648794)
This textbook presents the mathematics that is foundational to multimedia applications. Featuring a rigorous survey of selected results from algebra and analysis, the work examines tools used to create application software for multimedia signal proce...Lasīt vairāk
Developed from the authors introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many tools used for determining the performance of computer algo...Lasīt vairāk
Šī grāmata vairs netiek publicēta. Jums tiks paziņota lietotas grāmatas cena
Algorithms and Programming is primarily intended for a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding...Lasīt vairāk
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamental...Lasīt vairāk
(Izdošanas datums: 21-Oct-2003, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817642792)
This book is a comprehensive presentation of recent results and developments on several widely used transforms and their fast algorithms. In many cases, new options are provided for improved or new fast algorithms, some of which are not well known...Lasīt vairāk
Šī grāmata vairs netiek publicēta. Jums tiks paziņota lietotas grāmatas cena
This monograph investigates algorithms for determining power integral bases in algebraic number fields. It introduces the best-known methods for solving several types of diophantine equations using Baker-type estimates, reduction methods, and enumera...Lasīt vairāk
(Izdošanas datums: 01-Aug-1994, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817637866)
Matrix and polynomial computations are fundamental to the theory and practice of computing. The authors present a systematic treatment of algorithms and complexity in these two related areas. Their study of computations with Toeplitz matrices and oth...Lasīt vairāk
(Izdošanas datums: 01-Feb-1993, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817636586)
A study of two classical computational problems that not only amuse mathematicians, but also arise in the natural sciences: counting the elements of a finite set of combinatorial structures; and generating them at random from some probability distrib...Lasīt vairāk
(Izdošanas datums: 01-Jan-1993, Hardback, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9780817636548)
A revised edition of the authors classic monograph (Pitman, 1986) that presents an approach to the design and implementation of sequential programming languages based on the relationship between lambda-calculus and category theory. For researchers i...Lasīt vairāk
