Cantitate/Preț
Produs

Problems and Exercises in Discrete Mathematics: Texts in the Mathematical Sciences, cartea 14

Autor G.P. Gavrilov, A.A. Sapozhenko
en Limba Engleză Paperback – 15 dec 2010
Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra, k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions.
Audience:This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 75728 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 15 dec 2010 75728 lei  6-8 săpt.
Hardback (1) 76332 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 30 iun 1996 76332 lei  6-8 săpt.

Din seria Texts in the Mathematical Sciences

Preț: 75728 lei

Preț vechi: 92351 lei
-18% Nou

Puncte Express: 1136

Preț estimativ în valută:
13401 15714$ 11768£

Carte tipărită la comandă

Livrare economică 31 ianuarie-14 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789048147021
ISBN-10: 9048147026
Pagini: 440
Ilustrații: XII, 424 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:Softcover reprint of hardcover 1st ed. 1996
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Texts in the Mathematical Sciences

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

I Problems.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.- II Answers, Hints, Solutions.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.