Reflecting many of the recent advances and trends in this area, this classroom-tested text covers the core topics in discrete structures as outlined by the ACM and explores an assortment of novel applications, including simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. It p
Reflecting many of the recent advances and trends in this area, this classroom-tested text covers the core topics in discrete structures as outlined by the ACM and explores an assortment of novel applications, including simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. It p
Alexander Stanoyevitch is a professor at California State University-Dominguez Hills. He completed his doctorate in mathematical analysis at the University of Michigan, Ann Arbor, and has held academic positions at the University of Hawaii and the University of Guam. Dr. Stanoyevitch has taught many upper-level classes to mathematics and computer science students, has published several articles in leading mathematical journals, and has been an invited speaker at numerous lectures and conferences in the United States, Europe, and Asia. His research interests include areas of both pure and applied mathematics.
Inhaltsangabe
Logic and Sets. Relations and Functions Boolean Algebra and Circuit Design. The Integers Induction and Recursion. Number Systems. Counting Techniques Combinatorics and Generating Functions. Discrete Probability and Simulation. Complexity of Algorithms. Graphs Trees and Associated Algorithms. Graph Traversal and Optimization Problems. Randomized Search and Optimization Algorithms. Appendices. References. Index.
Logic and Sets. Relations and Functions Boolean Algebra and Circuit Design. The Integers Induction and Recursion. Number Systems. Counting Techniques Combinatorics and Generating Functions. Discrete Probability and Simulation. Complexity of Algorithms. Graphs Trees and Associated Algorithms. Graph Traversal and Optimization Problems. Randomized Search and Optimization Algorithms. Appendices. References. Index.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826