Software implementation of logic functions and automata. II. Computation time of binary programs

zbMATH Open0416.68047MaRDI QIDQ754644FDOQ754644

O. P. Kuznetsov

Publication date: 1977

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

computational complexityaverage times for computing logic functions by binary programsBoolean expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Theory of computing (68Q99)

Cited In (1)

• Minimization of binary decision diagrams for systems of incompletely defined Boolean functions

This page was built for publication: Software implementation of logic functions and automata. II. Computation time of binary programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754644)