On frequent sets of Boolean matrices

DOI10.1023/A:1018905417023zbMath0930.68128MaRDI QIDQ1286408

Ken Takata, György Turán, Robert H. Sloan

Publication date: 3 May 1999

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Boolean matrixefficient listing algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ On set systems with a threshold property ⋮ Non-uniform Turán-type problems ⋮ Generating dual-bounded hypergraphs

This page was built for publication: On frequent sets of Boolean matrices