scientific article; zbMATH DE number 89638

MaRDI QIDQ4016931zbMATH OpenFDO

Authors Daniel Olejár

Publication date 16 January 1993

zbMATH Keywords

Depth First Algorithmrandom square Boolean matrixtime complexityVLSI circuits

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)

Recommendations

• The rectangle covering number of random Boolean matrices
• On the complexity of narrow systems of Boolean vectors
• scientific article; zbMATH DE number 3974967
• On the Shannon function for the generation of Boolean matrices
• On complexity of realization of Boolean matrices with connected boundary

Cited in

(4)

• The rectangle covering number of random Boolean matrices
• scientific article; zbMATH DE number 1979525 (Why is no real title available?)
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• On a solution of a randomized three tracks variant of the Gate Matrix Layout problem

This page was built for publication:

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