scientific article; zbMATH DE number 1037955

zbMath0868.94058MaRDI QIDQ4345298

A. V. Chashkin

Publication date: 22 July 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityBoolean functionpartially defined Boolean functionShannon's functionnon-branching programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analytic circuit theory (94C05)

Related Items (8)

Mean computing time of Boolean operators by programs with restricted memory ⋮ On the average-case complexity of underdetermined functions ⋮ Bounds for the average-case complexity of monotone Boolean functions ⋮ An upper bound of unreliability of non-branching programs in an arbitrary complete finite basis for one-type constant faults at the outputs of computational operators ⋮ ON THE ARBITRARILY RELIABLE IMPLEMENTATION OF BOOLEAN FUNCTIONS BY NON-BRANCHING PROGRAMS WITH A CONDITIONAL STOP OPERATOR IN BASES WITH GENERALIZED CONJUNCTION ⋮ Reliability of nonbranching programs in an arbitrary complete finite basis ⋮ On the average-case complexity of Boolean functions under binomial distribution on their domains ⋮ On the implementation of monotone Boolean functions by memoryless programs

This page was built for publication: