Algorithmic Mathematics

Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Hougardy, Stefan (Συγγραφέας), Vygen, Jens (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02642nam a22004215i 4500
001 978-3-319-39558-6
003 DE-He213
005 20161014172331.0
007 cr nn 008mamaa
008 161014s2016 gw | s |||| 0|eng d
020 |a 9783319395586  |9 978-3-319-39558-6 
024 7 |a 10.1007/978-3-319-39558-6  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a PBKS  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 518.1  |2 23 
100 1 |a Hougardy, Stefan.  |e author. 
245 1 0 |a Algorithmic Mathematics  |h [electronic resource] /  |c by Stefan Hougardy, Jens Vygen. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XIII, 163 p. 41 illus., 40 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 1 Introduction -- 2 Representations of the Integers -- 3 Computing with Integers -- 4 Approximate Representations of the Real Numbers -- 5 Computing with Errors -- 6 Graphs -- 7 Simple Graph Algorithms -- 8 Sorting Algorithms -- 9 Optimal Trees and Paths -- 10 Matchings and Network Flows -- 11 Gaussian Elimination -- Bibliography -- Index. 
520 |a Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years. 
650 0 |a Mathematics. 
650 0 |a Algorithms. 
650 1 4 |a Mathematics. 
650 2 4 |a Algorithms. 
700 1 |a Vygen, Jens.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319395579 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-39558-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649)