Study of the bounds on the number of basic sets in a test.

zbMATH Open1097.68606MaRDI QIDQ2756405

R. Suárez, Alfonso Fuentes

Publication date: 12 November 2001

Published in: Revista Investigación Operacional (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests 👍 👎
• Bounds on the size of test sets for sorting and related networks 👍 👎
• Basis problems in combinatorial set theory 👍 👎
• Investigations Concerning the Structure of Complete Sets 👍 👎
• Tests and Proofs for Enumerative Combinatorics 👍 👎
• Near-Testable Sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Study of the bounds on the number of basic sets in a test.

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