Combinatorial Design Theory (12 results)

Paper bound in heavy orange wrappers, xii + Pp470. Tight and unmarked - a very good or better copy. 770 grams. All books in stock and available for immediate shipment from Winnipeg, Manitoba.

paperback. Condition: New. Language:Chinese.Paperback. Publisher: Shanghai Jiaotong.

Condition: Gut. Zustand: Gut | Seiten: 334 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Paperback. Condition: Brand New. 346 pages. 9.00x6.00x0.78 inches. In Stock.

Paperback. Condition: Brand New. 482 pages. 9.50x6.50x1.09 inches. In Stock.

Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

paperback. Condition: New. Pub Date :2008-01-01 Pages: 330 Publisher: Shanghai Jiaotong University Press book discusses the combination of design theory. The book is divided into 10 chapters. a comprehensive in-depth introduction to the block design. finite geometry. the basic concept of the main branches of the difference sets with poor family. Hadamard matrix. pairwise balanced design and resolvable designs combinatorial design theory. the basic theory and important method It also describes the combination of design .…

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a network (graph) of shortest length, where the length is the sum of the lengths of all edges. The difference between the Steiner tree problem and the minimum spanning tree problem is that, in the Steiner tree problem, extra intermediate vertices and edges may be added to the graph in order to reduce the length of the spanning tree. These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices. It has been proved that the resulting connection is a tree, known as the Steiner tree. There may be several Steiner trees for a given set of initial vertices. …

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In thecombinatorics and statistics, a Latin square is an n × n table filledwith n different symbols in such a way that each symbol occurs exactlyonce in each row and exactly once in each column. In the design ofexperiments, Latin squares are a special case of row-column designs fortwo blocking factors: Many row-column designs are constructed byconcatenating Latin squares. In algebra, Latin squares aregeneralizations of groups; in fact, Latin squares are characterized asbeing the multiplication tables of quasigroups. Other applicationsinclude error correcting codes. The name Latin square originates fromLeonhard Euler, who used Latin characters as symbols. A Latin square issaid to be reduced if its first row and first column are in naturalorder. For example, the Latin square above is reduced because both itsfirst row and its first column are 1,2,3. We can make any Latin squarereduced by permuting the rows and columns.…

Taschenbuch. Condition: Neu. Combinatorics | Pure mathematics, Mathematics, Algebra, Ergodic theory, Geometry, Enumerative combinatorics, Combinatorial design | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130253059 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Condition: Neu. Latin Square | Combinatorial design, Design of experiments, Blocking (statistics), Algebra, Group theory, Multiplication table, Cayley table | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131870156 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Condition: Neu. Steiner Tree Problem | Jakob Steiner, Combinatorial Optimization, Minimum spanning Tree, Tree (graph theory), Electrical Network, Network Planning and Design | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130333881 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…