The contributions to this volume have all been translated from the second volume of the Russian journal <em>Discrete Analysis and Operational</em> <em>Research</em>, published at the Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia, in 1995. <br/> 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 <em>Discrete Analysis and Operational Research</em>, published by Kluwer in 1996. <br/> <em>Audience:</em> This book will be of interest to specialists in discrete mathematics and computer science, and engineers.
"The contributions to this volume have all been translated from the second volume of the Russian journal <em>Discrete Analysis and Operational</em> <em>Research</em>, published at the Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia, in 1995. <br/> 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 <em>Discrete Analysis and Operational Research</em>, published by Kluwer in 1996. <br/> <em>Audience:</em> This book will be of interest to specialists in discrete mathematics and computer science, and engineers."@en
"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."
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.
This is a placeholder reference for a Topic entity, related to a WorldCat Entity. Over time, these references will be replaced with persistent URIs to VIAF, FAST, WorldCat, and other Linked Data resources.