Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 161.26
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 161.26
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 528.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 524.
Taschenbuch. Condition: Neu. Investigations in Algebraic Theory of Combinatorial Objects | I. A. Faradzev (u. a.) | Taschenbuch | xii | Englisch | 2010 | Springer | EAN 9789048141951 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Language: English
Published by Springer Netherlands, 1994
ISBN 10: 9048141958 ISBN 13: 9789048141951
Seller: Revaluation Books, Exeter, United Kingdom
US$ 226.02
Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 1994 edition. 528 pages. 9.25x6.10x1.19 inches. In Stock.
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of 'sports-like' results were obtained. Some of these results are still unsurpassed.
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of 'sports-like' results were obtained. Some of these results are still unsurpassed.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 232.22
Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand.
Language: English
Published by Springer Netherlands Nov 1993, 1993
ISBN 10: 0792319273 ISBN 13: 9780792319276
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of 'sports-like' results were obtained. Some of these results are still unsurpassed. 526 pp. Englisch.
Language: English
Published by Springer Netherlands Dez 2010, 2010
ISBN 10: 9048141958 ISBN 13: 9789048141951
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of 'sports-like' results were obtained. Some of these results are still unsurpassed. 528 pp. Englisch.
Language: English
Published by Springer Netherlands, 2010
ISBN 10: 9048141958 ISBN 13: 9789048141951
Seller: moluna, Greven, Germany
US$ 140.77
Quantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. X Koechendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this cen.
Language: English
Published by Springer Netherlands, 1993
ISBN 10: 0792319273 ISBN 13: 9780792319276
Seller: moluna, Greven, Germany
US$ 140.77
Quantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. X Koechendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this cen.
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
US$ 192.47
Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Seller: Majestic Books, Hounslow, United Kingdom
US$ 217.33
Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 524 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Seller: Majestic Books, Hounslow, United Kingdom
US$ 219.28
Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 528 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Language: English
Published by Springer, Springer Nov 1993, 1993
ISBN 10: 0792319273 ISBN 13: 9780792319276
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of 'sports-like' results were obtained. Some of these results are still unsurpassed.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 526 pp. Englisch.
Language: English
Published by Springer, Springer Dez 2010, 2010
ISBN 10: 9048141958 ISBN 13: 9789048141951
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -X Köchendorffer, L.A. Kalu:lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of 'sports-like' results were obtained. Some of these results are still unsurpassed.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 528 pp. Englisch.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 524.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 528.