Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ARSCOM
2000

favoriteEmaildiscussreport

79views more ARSCOM 2000»

On exact bicoverings of 12 points

13 years 4 months ago

On exact bicoverings of 12 points

Download mcs.open.ac.uk

The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted

J. L. Allston, Mike J. Grannell, Terry S. Griggs,

Real-time Traffic

ARSCOM 2000 | Cardinality | Incomplete Blocks | Minimum Number |

claim paper

Related Content

» Jacobi Curves Computing the Exact Topology of Arrangements of Nonsingular Algebraic Curves

» On the Complexity of Nash Equilibria and Other Fixed Points Extended Abstract

» On the Complexity of Nash Equilibria and Other Fixed Points

» On the importance of idempotence

» Symplectic Spreads and Permutation Polynomials

» Qualitative Velocity and Ball Interception

» Anisotropic Convection Model for the Earths Mantle

» Adding Compression to Block Addressing Inverted Indexes

» Abstract order type extension and new results on the rectilinear crossing number

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	ARSCOM
Authors	J. L. Allston, Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Ralph Gordon Stanton

Comments (0)