𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds estimation of factor-covering design sizes

✍ Scribed by Nobuhiko Ido; Tohru Kikuno

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
115 KB
Volume
11
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Factor‐covering designs have been studied with the aim of making efficient suites of test cases for software testing. One of the major concerns in these studies is the construction of factor‐covering designs of smaller sizes. In this paper, we propose a method of estimating the lower bounds of the sizes. The proposed method is based on two assumptions that a test design has parameters of the same range, and that all the values in the range are tested equally. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 89–99, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10039

πŸ“œ SIMILAR VOLUMES

New upper bounds on the minimum size of
New upper bounds on the minimum size of covering designs
✍ Iliya Bluskov; Heikki HΓ€mΓ€lΓ€inen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 310 KB πŸ‘ 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size

General Upper Bounds on the Minimum Size
General Upper Bounds on the Minimum Size of Covering Designs
✍ Iliya Bluskov; Katherine Heinrich πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 105 KB

Let D be a finite family of k-subsets (called blocks) of a v-set X(v). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks is the size of the covering, and the minimum size of the covering is called the covering nu

New lower bounds for the size of edge ch
New lower bounds for the size of edge chromatic critical graphs
✍ Yue Zhao πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 108 KB πŸ‘ 1 views

## Abstract In this paper, by applying the discharging method, we obtain new lower bounds for the size of edge chromatic critical graphs for small maximum degree Ξ”. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 81–92, 2004

An Exponential Lower Bound for the Size
An Exponential Lower Bound for the Size of Monotone Real Circuits
✍ Armin Haken; Stephen A. Cook πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 118 KB

We prove a lower bound, exponential in the eighth root of the input length, on the size of monotone arithmetic circuits that solve an NP problem related to clique detection. The result is more general than the famous lower bound of Razborov and Andreev, because the gates of the circuit are allowed t