On the essential test sets of discrete matrices

DOI10.1016/0166-218X(94)00055-IzbMATH Open0829.05016MaRDI QIDQ1894367FDOQ1894367

Authors: Alex Kogan 

Publication date: 7 January 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• Disjunct and selective matrices
• On the upper bounds of the minimum number of rows of disjunct matrices
• Some properties of Macula's matrix and its complement
• Test sets for generalized matrix functions
• Study of the bounds on the number of basic sets in a test.

zbMATH Keywords

treesdiscrete matricesessential test set

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Identification Keys and Diagnostic Tables: A Review
• Title not available (Why is that?)

Cited In (3)

• Identification of points using disks
• Discriminating codes in bipartite graphs
• Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets

This page was built for publication: On the essential test sets of discrete matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894367)