Synopses & Reviews
The contributions to this volume have all been translated from the second volume of the Russian journal Discrete Analysis and Operational Research, published at the Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia, in 1995. The papers collected here give an excellent overview of recent Russian research in such topics as analysis of algorithms, combinatorics, coding theory, graphs, lower bounds for complexity of Boolean functions and scheduling theory, and can be seen as an update of the book Discrete Analysis and Operational Research, published by Kluwer in 1996. Audience: This book will be of interest to specialists in discrete mathematics and computer science, and engineers.
Book News Annotation:
Twenty-four papers give engineers and specialists in discrete
mathematics and computer science an overview of recent Russian
research in topics such as analysis of algorithms, combinatorics,
coding theory, graphs, lower bounds for complexity of Boolean
functions, and scheduling theory. Translated from the second volume
of the Russian journal Discrete Analysis and Operational Research.
Annotation c. Book News, Inc., Portland, OR (booknews.com)