The complexity of the realization of certain recognition procedures

DOI10.1016/0041-5553(87)90121-2zbMath0648.68091OpenAlexW2071645112MaRDI QIDQ3793756

E. V. Dyukova

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90121-2

zbMATH Keywords

Boolean functionprime implicantsalmost maximal conjunctions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Boolean functions (06E30)

Related Items (2)

On the complexity of the dualization problem ⋮ Asymptotically optimal dualization algorithms

This page was built for publication: The complexity of the realization of certain recognition procedures