Recursive generation of locally complete tests

Autor:	I. S. Grunskii, S. Yu. Borodai
Rok vydání:	1993
Předmět:	Discrete mathematics General Computer Science ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION MathematicsofComputing_NUMERICALANALYSIS Row Astrophysics::Galaxy Astrophysics Mathematics
Zdroj:	Cybernetics and Systems Analysis. 28:504-508
ISSN:	1573-8337 1060-0396
DOI:	10.1007/bf01124983
Popis:	We consider 0–1 matrices with n columns in which any m columns (m < n) contain 2m different rows. Recursive equations and generation algorithms for these matrices are proposed.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::95771fb7d01c2fadc14dd430de21b80a https://doi.org/10.1007/bf01124983 Zobrazit plný text záznamu Full text from SpringerLink