Discrete Analysis and Operations Research: Mathematics and Its Applications, cartea 355
Editat de Alekseii D. Korshunoven Limba Engleză Hardback – 30 noi 1995
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 530.53 lei 39-44 zile | |
SPRINGER NETHERLANDS – 28 sep 2011 | 530.53 lei 39-44 zile | |
Hardback (1) | 540.54 lei 39-44 zile | |
SPRINGER NETHERLANDS – 30 noi 1995 | 540.54 lei 39-44 zile |
Din seria Mathematics and Its Applications
- Preț: 376.25 lei
- 9% Preț: 902.37 lei
- 24% Preț: 737.52 lei
- 20% Preț: 538.74 lei
- 20% Preț: 596.88 lei
- Preț: 356.90 lei
- 24% Preț: 753.30 lei
- 20% Preț: 555.30 lei
- 20% Preț: 538.97 lei
- Preț: 357.91 lei
- 20% Preț: 544.26 lei
- Preț: 351.67 lei
- Preț: 357.25 lei
- 20% Preț: 299.49 lei
- Preț: 349.05 lei
- 20% Preț: 547.69 lei
- 20% Preț: 579.72 lei
- Preț: 358.92 lei
- 20% Preț: 544.26 lei
- 20% Preț: 539.78 lei
- Preț: 353.34 lei
- 20% Preț: 539.78 lei
- 20% Preț: 530.78 lei
- Preț: 363.51 lei
- Preț: 342.07 lei
- 20% Preț: 549.55 lei
- 24% Preț: 741.37 lei
- 20% Preț: 535.54 lei
Preț: 540.54 lei
Preț vechi: 675.68 lei
-20%
Puncte Express: 811
Preț estimativ în valută:
103.56€ • 112.43$ • 88.81£
103.56€ • 112.43$ • 88.81£
Carte tipărită la comandă
Livrare economică 06-11 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792338666
ISBN-10: 0792338669
Pagini: 356
Ilustrații: VIII, 344 p.
Dimensiuni: 156 x 234 x 25 mm
Greutate: 0.67 kg
Ediția:1996
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
ISBN-10: 0792338669
Pagini: 356
Ilustrații: VIII, 344 p.
Dimensiuni: 156 x 234 x 25 mm
Greutate: 0.67 kg
Ediția:1996
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
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; D.G. Fon-Der-Flaass. An Approximation Algorithm for the Travelling Salesman Problem and Its Probabilistic Analysis; È.Kh. Gimadi, et al. On Minimum Independent Dominating Sets in Graphs; N.I. Glebov, A.V. Kostochka. Regular Partitions and Cuts in Integer Programming; A.A. Kolokolov. Complexity of Coverings of Number Sets by Arithmetical Progressions; A.D. Korshunov. Circuit Realization of the Sorting Problem; È.Sh. Kospanov. A Refinement of the Frank-Sebö-Tardos Theorem and Its Applications; A.V. Kostochka. On the Length of the Chinese Postman Tour in Regular Graphs; A.V. Kostochka, N. Tulai. An Integer Linear Programming Algorithm Polynomial in the Average Case; N.N. Kuzyurin. Projections of the Hypercube on the Line and the Plane; A.A. Levin. Canonical Decomposition of Graphs; V.V. Lozin. Fault Detection in Parts of the Circuits of Functional Element; V.N. Noskov. On the External Stability Number of the Generalized De Bruijn Graphs; V. Nyu. On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions; K.L. Rychkov. Efficient Scheduling in Open Shops; S.V. Sevast'yanov. Nonstrict Vector Summation in Scheduling Problems; S.V. Sevast'yanov. Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem; Yu.V. Shamardin. On the Depth of Conditional Tests for Controlling `Negation' Type Faults in Circuits of Functional Gates; V.I. Shevchenko. Synthesis of Transitive Order Relations Compatible with the Power ofCriteria; L.A. Sholomov. Index.