1 code implementation • 14 Aug 2012 • Mirjam Friesen, Aya Hamed, Troy Lee, Dirk Oliver Theis
An $n\times n$ matrix $M$ is called a \textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,\ell} M_{\ell, k} = 0$ for every $k\ne \ell$.
Combinatorics Computational Complexity 15B35, 05C70, 15B34, 94A05, 68Q15
