2 papers
cs.CC2026
Upper bounds for the monotone rank of the unique disjointness matrix
Igor S. Sergeev
It is shown that the -rank (covering rank) of the unique disjointness matrix is , hence the known lower bound turns out to be…
cs.DS2026
Complexity of basic boolean operators for digital circuit design
Igor S. Sergeev
This article provides a survey of circuit complexity bounds for basic boolean transforms exploited in digital circuit design and efficient methods for synthesizing such circuits. T…