On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
From MaRDI portal
Publication:3835734
DOI10.1515/dma.1994.4.3.229zbMath0925.68334OpenAlexW1996751800MaRDI QIDQ3835734
Publication date: 22 May 1995
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1994.4.3.229
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
On the average-case complexity of underdetermined functions ⋮ Fast monotone summation over disjoint sets ⋮ On the additive complexity of GCD and LCM matrices ⋮ Arithmetic complexity of certain linear transformations
This page was built for publication: On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
