ARSCOM 2000 | Sciweavers

72

ARSCOM
2000

62views more ARSCOM 2000»

15 years 2 months ago

T. Aaron Gulliver, Masaaki Harada

claim paper

Read More »

64

ARSCOM
2000

56views more ARSCOM 2000»

15 years 2 months ago

Hung-Lin Fu, I-Fan Sun

claim paper

Read More »

117

ARSCOM
2000

79views more ARSCOM 2000»

15 years 2 months ago

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, ...

claim paper

Read More »

Sciweavers