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ă Hardback – 30 iun 1996
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) 78778 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 15 dec 2010 78778 lei  6-8 săpt.
Hardback (1) 79407 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 30 iun 1996 79407 lei  6-8 săpt.

Din seria Texts in the Mathematical Sciences

Preț: 79407 lei

Preț vechi: 96838 lei
-18% Nou

Puncte Express: 1191

Preț estimativ în valută:
15196 15769$ 12701£

Carte tipărită la comandă

Livrare economică 18 martie-01 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792340362
ISBN-10: 0792340361
Pagini: 424
Ilustrații: XII, 424 p.
Dimensiuni: 156 x 234 x 25 mm
Greutate: 0.79 kg
Ediția: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.