Isbn: 9780792338666 - discrete analysis and operations research: 355 (mathematics and its applications, 355) (17 resultados)

Hardcover. Condición: Very Good+. Estado de la sobrecubierta: 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.…

Condición: New.

Condición: New.

Condición: New.

Condición: New. In English.

Condición: 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. . . . . …

Buch. Condición: 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.…

Condición: New. pp. 356.

Condición: 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. …

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Preface. The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence S.V. Avgustinovich. Locally Isometric Embeddings of Graphs and the Metric Prolongation Property A.A. Evdokimov. Local Complementations of Simple and Directed Graphs.…

Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence.- Locally Isometric Embeddings of Graphs and the Metric Prolongation Property.- Local Complementations of Simple and Directed Graphs.- An Approximation Algorithm for the Traveling Salesman Problem and Its Probabilistic Analysis.- On Minimum Independent Dominating Sets in Graphs.- Regular Partitions and Cuts in Integer Programming.- Complexity of Coverings of Number Sets by Arithmetical Progressions.- Circuit Realization of the Sorting Problem.- A Refinement of the Frank-Seb -Tardos Theorem and Its Applications.- On the Length of the Chinese Postman Tour in Regular Graphs.- An Integer Linear Programming Algorithm Polynomial in the Average Case.- Projections of the Hypercube on the Line and the Plane.- Canonical Decomposition of Graphs.- Fault Detection in Parts of the Circuits of Functional Elements.- On the External Stability Number of the Generalized De Bruijn Graphs.- On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions.- Efficient Scheduling in Open Shops.- Nonstrict Vector Summation in Scheduling Problems.- Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem.- On the Depth of Conditional Tests for Controlling 'Negation' Type Faults in Circuits of Functional Gates.- Synthesis of Transitive Order Relations Compatible with the Power of Criteria.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 356 pp. Englisch. …

Condición: New. Print on Demand pp. 356 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 356 pp. Englisch. …

Condición: New. PRINT ON DEMAND pp. 356.