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

MaRDI QIDQ754644zbMATH OpenFDO

Authors O. P. Kuznetsov

Publication date 1977

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

zbMATH Keywords

average times for computing logic functions by binary programsBoolean expressionscomputational complexity

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) 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)