scientific article
From MaRDI portal
Publication:3710469
zbMath0584.94023MaRDI QIDQ3710469
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Combinatorial geometries and geometric closure systems (51D20)
Related Items
Lower bounds for depth-restricted branching programs ⋮ On the size of binary decision diagrams representing Boolean functions
