9780792338666 - Discrete Analysis and Operations Research (Mathematics and Its Applications, 355, Band 355) (3 Ergebnisse)

Zustand: New. In.

Zustand: New. The papers collected here provide an 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. Editor(s): Korshunov, Alekseii D. Series: Mathematics and its Applications. Num Pages: 344 pages, biography. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 20. Weight in Grams: 675. . 1995. Hardback. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book contains translations of papers from the first volume of the new Russian-language journal published at the Sobolev Institute of Mathematics (Sibe rian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. In 1994 the journal was titled Sibirskil Zhurnal Issledovaniya Operatsil. Since 1995 this journal has the title DiskretnYl Analiz i Issledovanie Operatsil (Discrete Analysis and Operations Research) The aim of this journal is to bring together research papers in different areas of discrete mathematics and computer science. The journal DiskretnYl Analiz i Issledovanie Operatsil covers the following fields: discrete optimization synthesis and complexity discrete structures and of control systems extremal problems automata combinatorics graphs control and reliability game theory and its of discrete devices applications mathematical models and coding theory methods of decision making scheduling theory design and analysis functional systems theory of algori thms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length. A. D. Korshunov THE NUMBER OF DISTINCT SUBWORDS OF FIXED LENGTH IN THE MORSE-HEDLUND SEQUENCEt) S. V. Avgustinovich An exact formula is obtained for the number of distinct subwords of length n in the Morse-Hedlund sequence [1), i. e. , the sequence in which the initial member is 0 and subsequent members are produced by unlimited application of the operation of substituting 01 for 0 and 10 for 1.