Digital Commons @ Michigan Tech
metadata only
Covering Arrays of Strength Three
A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present expl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Completing the Existence Problem for Integer Relative Heffter Arrays $\mathrm{H}_k(n;k)$#1050578
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Construction of orthogonal arrays#356746
- Antibody array generation and use.#452347
Record · ID 921555
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive