Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Designs 2002 : Further Computational and Constructive Design Theory - W.D. Wallis

Designs 2002

Further Computational and Constructive Design Theory

By: W.D. Wallis

eText | 1 December 2013 | Edition Number 2

At a Glance

eText

$84.99

or 4 interest-free payments of $21.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re­ lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec­ trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionMathematicsCombinatorics & Graph TheoryComputing & I.T.Computer ScienceDatabasesData Capture & AnalysisComputer Programming & Software DevelopmentAlgorithms & Data StructuresApplied MathematicsOptimisationLinear Programming

Other Editions and Formats

Paperback

Published: 11th July 2012

View Product

More in Combinatorics & Graph Theory

Mathematical Tales - Leonar G.

eBOOK

Mathematical Tales

eBook

$28.99

More Monthly Problem Gems - Hongwei Chen

eTEXT

More Monthly Problem Gems

eText

$78.09

Mathematics in Ancient Egypt : A Contextual History - Annette Imhausen

eBOOK

Mathematics in Ancient Egypt

A Contextual History

eBook

RRP $84.70

$67.99

20%
OFF
The Fascinating World of Graph Theory - Arthur Benjamin

eBOOK

The Fascinating World of Graph Theory

eBook

RRP $44.00

$35.99

18%
OFF

This product is categorised by