Results 221 to 230 of about 9,542 (233)
Some of the next articles are maybe not open access.
Average-Case Complexity of Partial Boolean Functions
2003The average-case complexity of partial Boolean functions is considered. For almost all functions it is shown that, up to a multiplicative constant, the average-case complexity does not depend on the size of the function’s domain but depends only on the number of tuples on which the function is equal to unity.
openaire +1 more source
Complexity of sequential computations of partial Boolean functions by circuits
Journal of Applied and Industrial Mathematics, 2008A pair (f, g) of partial Boolean functions is characterized by a tuple of parameters lαβ that is the number of tuples \( \tilde x \) such that (f(\( \tilde x \) ), g(\( \tilde x \) )) = (α, β), where α and β take the values 0, 1, and an undefined value. The sequential computation of (f, g) is considered when a circuit Sf for f is constructed first, and,
openaire +1 more source
Complexity of sequential implementation of partial Boolean functions
Doklady Mathematics, 2007openaire +1 more source
On some operations of partial monotone boolean function simplifying
1987L. M. Karahanjan, A. A. Sapozhenko
openaire +1 more source