Discrete and combinatorial mathematics: an applied introduction / Ralph P. Grimaldi
Tipo de material: TextoIdioma: eng. Detalles de publicación: Boston: Pearson Addison Wesley, 2004Edición: 5a edDescripción: 833 p.: il.; 26 cmISBN: 0201726343Tema(s): MATEMÁTICAS | COMPUTACIÓN | CIRCUITOS LÓGICOSClasificación CDD: 512.1
Contenidos:
Contenido:
Fundamental Principles of Counting.
Fundamentals of Logic.
Set Theory.
Properties of the Integers: Mathematical Induction.
Relations and Functions.
Languages: Finite State Machines.
Relations: The Second Time Around.
The Principle of Inclusion And Exclusion.
Generating Functions.
Recurrense Relations.
An Introduction to Graph Theory.
Trees.
Optimizacion and Matching.
Rings and Modular Aritmetic.
Boolean Algebra and Switching Functions.
Groups, Coding Theory, and Polyas Method of enumeration.
Finite Fields and Combinatorial Designs.
Tipo de ítem | Biblioteca actual | Signatura | Estado | Fecha de vencimiento | Código de barras |
---|---|---|---|---|---|
Libros | Biblioteca Especializada de Ingeniería Civil | 512.1 G81 (Navegar estantería(Abre debajo)) | Disponible | FIC3953 |
Navegando Biblioteca Especializada de Ingeniería Civil Estantes Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
Contenido:
Fundamental Principles of Counting.
Fundamentals of Logic.
Set Theory.
Properties of the Integers: Mathematical Induction.
Relations and Functions.
Languages: Finite State Machines.
Relations: The Second Time Around.
The Principle of Inclusion And Exclusion.
Generating Functions.
Recurrense Relations.
An Introduction to Graph Theory.
Trees.
Optimizacion and Matching.
Rings and Modular Aritmetic.
Boolean Algebra and Switching Functions.
Groups, Coding Theory, and Polyas Method of enumeration.
Finite Fields and Combinatorial Designs.
No hay comentarios en este titulo.