Usted se encuentra revisando un registro bibliográfico de la BDU Para conocer mas sobre la Base de Datos Unificada haga click en el ícono del home

Titulos:
Discrete mathematics / Norman L. Biggs
Idiomas:
eng
ISBN:
0198534272
Lugar de Edición:
New York:
Editor:
Oxford Science Publications,
Fecha de Edición:
1989 (reimpresión 1998)
Edición #:
rev. ed.
Notas Formateada:
Part I.Numbers and counting: 1.Integers 2.Functions and counting 3.Principles of counting 4.Subsets and designs 5.Partition, classification, and distribution 6.Modular arithmetic Part II.Graphs and algorithms: 7.Algorithms and their efficiency 8.Graphs 9.Trees, sorting, and searching 10.Bipartite graphs and matching problems 11.Digraphs, networks, and flows 12.Recursive techniques Part III.Algebraic methods: 13.Groups 14.Groups of permutations 15.Rings, fields, and polynomials 16.Finiete fields and some applications 17.Error-correcting codes 18.Generating functions 19.Partitions of a positive integer 20.Symmetry and counting
Palabras clave:
TEORIA DE GRAFOS; ALGORITMOS; ARBOLES; ALGEBRA

Leader:
cam
Campo 003:
AR-BaIT
Campo 008:
270401t1989t xxk|||||||||||||||||eng||
Campo 020:
^a0198534272
Campo 040:
^aITBA^cITBA
Campo 041:
0 ^aeng
Campo 100:
1 ^aBiggs, Norman L.^93150
Campo 245:
10^aDiscrete mathematics /^cNorman L. Biggs
Campo 246:
Campo 250:
^arev. ed.
Campo 260:
^aNew York:^bOxford Science Publications,^c1989 (reimpresión 1998)
Campo 300:
^axiv, 480 p.
Campo 505:
0 ^aPart I.Numbers and counting: 1.Integers 2.Functions and counting 3.Principles of counting 4.Subsets and designs 5.Partition, classification, and distribution 6.Modular arithmetic Part II.Graphs and algorithms: 7.Algorithms and their efficiency 8.Graphs 9.Trees, sorting, and searching 10.Bipartite graphs and matching problems 11.Digraphs, networks, and flows 12.Recursive techniques Part III.Algebraic methods: 13.Groups 14.Groups of permutations 15.Rings, fields, and polynomials 16.Finiete fields and some applications 17.Error-correcting codes 18.Generating functions 19.Partitions of a positive integer 20.Symmetry and counting
Campo 650:
4^91301^aTEORIA DE GRAFOS
Campo 650:
4^955^aALGORITMOS
Campo 650:
4^996^aARBOLES
Campo 650:
4^950^aALGEBRA
Proveniencia:
^aInstituto Tecnológico Buenos Aires (ITBA) - Biblioteca
Seleccionar y guardar el registro Haga click en el botón del carrito
Institucion:
Instituto Tecnológico Buenos Aires (ITBA)
Dependencia:
Biblioteca

Compartir este registro en Redes Sociales

Seleccionar y guardar el registro Haga click en el botón del carrito