Sapozhenko (25 results)

Encuadernación de tapa dura. Condition: Bien. Sin Sobrecubierta. M034707. Mir Moscú - 316pp Cartoné con fórmulas en el interior. PA.

Soft cover. Condition: As New. Contents: 1. Boolean functions: methods of defining and basic properties. 2. Closed classes and completeness. 3. K-Valved logics. 4. Graphs and networks. 5. Fundamentals of coding theory. 6. Finite automatons. 7. Fundamentals of the algorithm theory. 8. Elements of combinatorial analysis. This collection of problems is intended as an accompaniment to a course on discrete mathematics at the universities. Senior students and graduates specializing in mathematical cybernetics may also find the book useful. Lecturers can use the material for exercise during seminars. The material in this book is based on a course of lectures on discrete mathematics delivered by the authors over a number of years at the Faculty of Mechanics and Mathematics, and later at the Faculty of Computational mathematics and Cybernetics at Moscow State University. The reader can use Introduction to Discrete Mathematics by S. Yablonsky as the main text when solving the problems in this collection. The book consists of eight chapters. Hints and answers are provided for most (but not all) problems. Solutions are given in a concise form in the form of notes, and trivial conclusions are omitted. In some cases, only the outlines of solutions are presented. The exercise in the book have various origins. Most of the material is traditional and specialists on discrete mathematics are all too familiar with such problems. However, it is practically impossible to trace the origin of the problems of this kind.…

Hardcover. Condition: Near Fine. Very Good dust. Name written on the front endpaper, else sharp and clean book. The dustjacket is now protected in a new, removable archival sleeve.; Small 8vo 7½" - 8"; 414 pages.

Hardcover. Condition: New. Hardcover, new, with dust jacket; translated from Russian by Ram S. Wadhwa and Natalia V. Wadhwa; revised from the 1977 Russian edition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. In English.

Condition: New. In English.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. 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. This book is suitable for undergraduate students of discrete mathematics, and also to postgraduates and researchers. Series: Texts in the Mathematical Sciences. Num Pages: 424 pages, biography. BIC Classification: PBCD. Category: (G) General (US: Trade); (P) Professional & Vocational; (UU) Undergraduate. Dimension: 234 x 156 x 25. Weight in Grams: 791. . 1996. Hardback. . . . . …

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condition: New. pp. 440.

Condition: New. pp. 436.

Condition: New. 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. This book is suitable for undergraduate students of discrete mathematics, and also to postgraduates and researchers. Series: Texts in the Mathematical Sciences. Num Pages: 424 pages, biography. BIC Classification: PBCD. Category: (G) General (US: Trade); (P) Professional & Vocational; (UU) Undergraduate. Dimension: 234 x 156 x 25. Weight in Grams: 791. . 1996. Hardback. . . . . Books ship from the US and Ireland. …

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Condition: Good. In Russian. Sapozhenko, Alexander Antonovich. Disjunctive Normal Forms. Moscow: Moscow University Publishing House, 1975. All images are for identification of editions only. Several books of the same edition may be available. Please feel free to request photos of available books.SKU6996360.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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, a.…

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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, a.…

Condition: New. Print on Demand pp. 440 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Condition: New. Print on Demand pp. 436 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg 440 pp. Englisch. …

Condition: New. PRINT ON DEMAND pp. 440.

Condition: New. PRINT ON DEMAND pp. 436.