Publication:3809266
From MaRDI portal
zbMath0659.68064MaRDI QIDQ3809266
Publication date: 1985
68Q25: Analysis of algorithms and problem complexity
Related Items
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes, On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube, ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO, On convex complexity measures, On covering graphs by complete bipartite subgraphs, Formula complexity of a linear function in a \(k\)-ary basis, Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions