Discrete Analysis and Operations Research
By: edited by Alekseǐ D. Korshunov
Series: Mathematics and Its Applications -- 355; Mathematics and Its Applications -- 355
Publisher: Springer Netherlands
Published: 1996
Place of publication: Dordrecht
Language: eng
Format: [electronic resource] /
Number of pages: 344
ISBN-13: 9789401072175; 9789400916067
Subjects: Computational complexity; Information theory; Mathematical optimization; Computer science
Description: The contributions to this volume have all been translated from the first 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 1994. The papers collected here give an excellent overview of recent Russian research in topics such as analysis of algorithms, combinatorics, graphs, lower bounds for complexity of Boolean functions, packing and coverings, scheduling theory, search and sorting, linear programming, and testing. Audience: This book will be of interest to specialists in discrete mathematics and computer science, and engineers.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.