Complexity of sequential implementation of partial Boolean functions

DOI10.1134/S1064562407030313zbMATH Open1178.94265MaRDI QIDQ2377493

L. A. Sholomov

Publication date: 19 January 2009

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Could not fetch data.

Related Items (7)

Denseness of volatile and nonvolatile sequences of functions ⋮ ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS ⋮ Time-optimal short-circuit evaluation of Boolean expressions ⋮ Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines ⋮ Title not available (Why is that?) ⋮ Complexity of implementation of parity functions in the implication–negation basis ⋮ Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms

This page was built for publication: Complexity of sequential implementation of partial Boolean functions

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