When is a partial Latin square uniquely completable, but not its completable product? | 0 | 0.34 | 2008 |
An Application Of Covering Designs: Determining The Maximum Consistent Set Of Shares In A Threshold Scheme | 15 | 1.42 | 1999 |
The Size Of The Smallest Strong Critical Set In A Latin Square | 16 | 3.49 | 1999 |
On the Maximum Number of Implicants Needed to Cover a Multiple-Valued Logic Function Using Window Literals | 5 | 0.62 | 1991 |
The equivalence of certain equidistant binary codes and symmetric BIBDs. | 9 | 1.28 | 1984 |
The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices | 1 | 0.49 | 1975 |