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

Din seria Texts in the Mathematical Sciences

Preț: 75478 lei

Preț vechi: 92046 lei
-18%

Puncte Express: 1132

Preț estimativ în valută:
13349 15426$ 11521£

Carte tipărită la comandă

Livrare economică 25 aprilie-09 mai


Specificații

ISBN-13: 9789048147021
ISBN-10: 9048147026
Pagini: 440
Ilustrații: XII, 424 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:Softcover reprint of hardcover 1st ed. 1996
Editura: Springer
Colecția Texts in the Mathematical Sciences
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.