9780521455138 - Combinatorial Methods in Discrete Mathematics de Sachkov, Vladimir N. (19 résultats)

Hardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.4.

Hardcover. Etat : Fine. Etat de la jaquette : Fine. 1st Edition. Still in the shrink-wrapping. List price Amazon - $162.00.".this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate. " (Publisher).

Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Etat : Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.

Hardcover. Etat : ex library-very good. Encyclopedia of Mathematics and its Applications Vol. 55. xiii, 306 p. 24 cm. Red cloth. Ex library with labels on spine and front cover, ink stamps on top edge and title page. Spine head a bit bumped.

Etat : New. In English.

Etat : New.

Etat : New. pp. 324.

Hardcover. Etat : new. Hardcover. Discrete mathematics is an important tool for the investigation of various models of functioning of technical devices, especially in the field of cybernetics. Here the author presents some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. Professor Sachkov's aim is to focus attention on results that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, considered in Chapter 4. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book for graduate students and professionals that describes many ideas not previously available in English; the author has updated the text and references where appropriate. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Hardcover. Etat : Like New. Like New. book.

Etat : New.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This is an attempt to present some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on those that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 4. The general combinatorial scheme is then introduced and, in the final chapter, Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the opportunity to update the text and references where appropriate.

Hardcover. Etat : new. Hardcover. Discrete mathematics is an important tool for the investigation of various models of functioning of technical devices, especially in the field of cybernetics. Here the author presents some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. Professor Sachkov's aim is to focus attention on results that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, considered in Chapter 4. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book for graduate students and professionals that describes many ideas not previously available in English; the author has updated the text and references where appropriate. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Etat : new. Hardcover. Discrete mathematics is an important tool for the investigation of various models of functioning of technical devices, especially in the field of cybernetics. Here the author presents some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. Professor Sachkov's aim is to focus attention on results that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, considered in Chapter 4. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book for graduate students and professionals that describes many ideas not previously available in English; the author has updated the text and references where appropriate. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Etat : Brand New. 306 pages. 9.75x6.50x1.00 inches. In Stock. This item is printed on demand.

Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 680.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. This is an important book, describing many ideas not previously available in E.

Etat : New. Print on Demand pp. 324 9:B&W 6 x 9 in or 229 x 152 mm Case Laminate on Creme w/Gloss Lam.

Etat : New. PRINT ON DEMAND pp. 324.