Publication:3809266
From MaRDI portal
zbMath0659.68064MaRDI QIDQ3809266
Publication date: 1985
68Q25: Analysis of algorithms and problem complexity
Related Items
On convex complexity measures, On covering graphs by complete bipartite subgraphs, Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions