Discrete analysis operations research (63 risultati)

hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

hardcover. Condizione: VERY GOOD. NONE. 537 clean, unmarked, tight pages; a couple pale smudges on top edge of textblock; cover is clean and sturdy; no dj as issued; May require extra shipping outside the U.S.

Hardcover. Condizione: Very Good+. Condizione sovraccoperta: No Dust Jacket Issued. First Edition. In English, with various translators. This book contains translations of papaers from the first volume of the new Russ-language journal published at the Sobolev Institute of Mathematics (Siberian Branch of the Russian Academy of Sciences, Novosibirsk) since 1994. The journal was titled 'Sibirskii Zhurnal Issledovaniya Operatsii', then 'Diskretnyi Analiz i Issledovanie Operatii'. Text appears clean, exterior looks great, binding tight/sturdy/square. NOT x-lib. Ships same or next business day from Dinkytown in Minneapolis, Minnesota.…

Hardcover. Condizione: new. New Copy. Customer Service Guaranteed.

Hardcover. Condizione: New. US SELLER SHIPS FAST FROM USA.

Hardcover. Condizione: New. US SELLER SHIPS FAST FROM USA.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

PF. Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New. In English.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: 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. . . . . …

Condizione: New. pp. 356.

Condizione: New. pp. 348 Index.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book contains translations of papers from the second 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 Oper atsil. Since 1995 this journal has the title Diskretny'l Analiz i Issledovanie Operatsi'l (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 algorithms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length. The journal is published in one volume of four issues per year that appear in March, June, September, and December. Each volume contains approximately 400 pages. I express my sincere gratitude to Professor S. S. Kutateladze for his help in editing the English translation. …

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book contains translations of papers from the second 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 Oper atsil. Since 1995 this journal has the title Diskretny'l Analiz i Issledovanie Operatsi'l (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 algorithms Contributions presented to the journal can be original research papers and occasional survey articles of moderate length. The journal is published in one volume of four issues per year that appear in March, June, September, and December. Each volume contains approximately 400 pages. I express my sincere gratitude to Professor S. S. Kutateladze for his help in editing the English translation.…

Buch. Condizione: 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.…