Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
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.
Synopsis
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.