Introductory Discrete Mathematics (Dover Books on Computer Science)

3,92 valoración promedio
( 13 valoraciones por Goodreads )
 
9780486691152: Introductory Discrete Mathematics (Dover Books on Computer Science)

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.
Chapters 0–3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ― the minimal spanning tree problem and the shortest distance problem ― are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.

"Sinopsis" puede pertenecer a otra edición de este libro.

About the Author:

V. K. Balakrishnan is Professor Emeritus at the University of Maine.

"Sobre este título" puede pertenecer a otra edición de este libro.

Los mejores resultados en AbeBooks

1.

Balakrishnan, V. K.
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Cantidad: > 20
Librería
Paperbackshop-US
(Wood Dale, IL, Estados Unidos de America)
Valoración
[?]

Descripción 2010. PAP. Estado de conservación: New. New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. Nº de ref. de la librería V0-9780486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 5,79
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,37
A Estados Unidos de America
Destinos, gastos y plazos de envío

2.

Balakrishnan, V. K .
Editorial: Dover Publishers
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Cantidad: > 20
Librería
INDOO
(Avenel, NJ, Estados Unidos de America)
Valoración
[?]

Descripción Dover Publishers. Estado de conservación: New. Brand New. Nº de ref. de la librería 0486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 7,01
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 2,95
A Estados Unidos de America
Destinos, gastos y plazos de envío

3.

V.K. Balakrishnan
Editorial: Dover Publications Inc., United States (2010)
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Paperback Cantidad: 1
Librería
The Book Depository
(London, Reino Unido)
Valoración
[?]

Descripción Dover Publications Inc., United States, 2010. Paperback. Estado de conservación: New. New edition. Language: English . Brand New Book. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems. Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material. Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ? the minimal spanning tree problem and the shortest distance problem ? are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix. Nº de ref. de la librería AAC9780486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 10,30
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

4.

Balakrishnan, V. K.
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Cantidad: 2
Librería
Pbshop
(Wood Dale, IL, Estados Unidos de America)
Valoración
[?]

Descripción 2010. PAP. Estado de conservación: New. New Book.Shipped from US within 10 to 14 business days. Established seller since 2000. Nº de ref. de la librería IB-9780486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 7,20
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,37
A Estados Unidos de America
Destinos, gastos y plazos de envío

5.

V.K. Balakrishnan
Editorial: Dover Publications Inc., United States (2010)
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Paperback Cantidad: 10
Librería
Book Depository hard to find
(London, Reino Unido)
Valoración
[?]

Descripción Dover Publications Inc., United States, 2010. Paperback. Estado de conservación: New. New edition. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems. Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material. Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ? the minimal spanning tree problem and the shortest distance problem ? are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix. Nº de ref. de la librería BTE9780486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 10,64
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

6.

Balakrishnan, V. K .
Editorial: Dover Publications (2010)
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Paperback Cantidad: 1
Librería
Murray Media
(North Miami Beach, FL, Estados Unidos de America)
Valoración
[?]

Descripción Dover Publications, 2010. Paperback. Estado de conservación: New. Never used!. Nº de ref. de la librería 0486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 9,55
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 1,68
A Estados Unidos de America
Destinos, gastos y plazos de envío

7.

V.K. Balakrishnan
Editorial: Dover Publications Inc., United States (2010)
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos Paperback Cantidad: 1
Librería
The Book Depository US
(London, Reino Unido)
Valoración
[?]

Descripción Dover Publications Inc., United States, 2010. Paperback. Estado de conservación: New. New edition. Language: English . Brand New Book. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems. Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material. Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ? the minimal spanning tree problem and the shortest distance problem ? are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix. Nº de ref. de la librería AAC9780486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 11,39
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

8.

Balakrishnan, V. K .
Editorial: Dover Publications
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos PAPERBACK Cantidad: 1
Librería
Booklot COM LLC
(Philadelphia, PA, Estados Unidos de America)
Valoración
[?]

Descripción Dover Publications. PAPERBACK. Estado de conservación: New. 0486691152. Nº de ref. de la librería Z0486691152ZN

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 12,16
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

9.

Balakrishnan, V. K .
Editorial: Dover Publications
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos PAPERBACK Cantidad: 1
Librería
Lakeside Books
(Benton Harbor, MI, Estados Unidos de America)
Valoración
[?]

Descripción Dover Publications. PAPERBACK. Estado de conservación: New. 0486691152 BRAND NEW, GIFT QUALITY, DIRECT FROM THE PUBLISHER! NOT MARKED UP REMAINDERS OR DINGED AND DIRTY OVERSTOCKS!. Nº de ref. de la librería OTF-S-9780486691152

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 9,08
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,37
A Estados Unidos de America
Destinos, gastos y plazos de envío

10.

Balakrishnan, V. K .
Editorial: Dover Publications
ISBN 10: 0486691152 ISBN 13: 9780486691152
Nuevos PAPERBACK Cantidad: > 20
Librería
Mediaoutlet12345
(Springfield, VA, Estados Unidos de America)
Valoración
[?]

Descripción Dover Publications. PAPERBACK. Estado de conservación: New. 0486691152 *BRAND NEW* Ships Same Day or Next!. Nº de ref. de la librería NATARAJB1FI999210

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 9,40
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,37
A Estados Unidos de America
Destinos, gastos y plazos de envío

Existen otras copia(s) de este libro

Ver todos los resultados de su búsqueda