Operations Research and Discrete Analysis (Mathematics and Its Applications (closed)): 391 - Brossura

Brossura

ISBN 10: 9401063958 ISBN 13: 9789401063951

Casa editrice: Springer, 2013

Riassunto

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.

Su questo libro

Contenuti

Preface. On Discrete Approximations of Continuous Functions with Bounded Second Derivative; G.G. Amanzhaev. On a Property of Perfect Binary Codes; S.V. Avgustinovich. Edge Neighborhoods in Normal Maps; S.V. Avgustinovich, O.V. Borodin. An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube; P.G. Emel'yanov. Operations and Isometric Embeddings of Graphs Related to the Metric Prolongation Property; T.I. Fedoryaeva. Effective Algorithms for Solving Multi-Level Plant Location Problem; È.Kh. Gimadi. On the Complexity of Realization of Boolean Functions by Circuits over an Infinite Basis; O.M. Kasim-Zade. Dynamic Problems of Choosing Optimal Composition of a System of Technical Tools; Yu.A. Kochetov, M.G. Pashchenko. Lower Bounds in the Problem of Choosing an Optimal Composition of a Two-Level System of Technical Tools; Yu.A. Kochetov, M.G. Pashchenko. On Schedules of a Single Machine Jobs with Processing Times Nonlinear in Time; A.V. Kononov. Problems of Reconstructing Words from Their Fragments and Applications; V.K. Leont'ev. A Vertex Variant of the Kleitman-West Problem; B. List. Regular Graphs Whose Every Edge Belongs to Many Triangles; A.A. Makhnëv. On Closed Classes in k-Valued Logic Which Contain a Homogeneous Switching Function; S.S. Marchenkov. Strongly Essential Variables of the Functions of k-Valued Logic; I. Mirchev. On Comparison Between the Sizes of Read-k-Times Branching Programs; E.A. Okol'nishnikova. Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network; A.V. Pyatkin. The Maximum-Weight Traveling Salesman Problem in Finite-Dimensional Real Spaces; A.I. Serdyukov. Nonstrict Vector Summation in the Plane and Its Applications to Scheduling Problems; S.V. Sevast'yanov.Bounds for Approximate Solution of a Scheduling Problem; P.I. Sharygin. On Certain Bounds for the Weight of l- Balanced Boolean Functions; Yu.V. Tarannikov. Spectral Properties of Perfect Binary (n,3)-Codes; A.Yu. Vasile'va. Distributive Coloring of Graph Vertices; V.G. Vizing. Deciphering Threshold Functions of k-Valued Logic; N.Y. Zolotykh, V.N. Shevchenko. Index.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2013
• Lingua: Inglese
• ISBN 10: 9401063958
• ISBN 13: 9789401063951
• Rilegatura: Copertina flessibile
• Numero di pagine: 348
• Redattore: Korshunov Alekseii D.
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania