AbstractThe average time of computing Boolean operators by straight-line programs of two types is studied. Upper and lower bounds for the corresponding Shannon functions are obtained. Asymptotically exact formulas for Shannon functions are derived in the case when the number of components of the operators to be computed increases with the number of their arguments
A deterministic sequential device receives one input symbol at a time, prints output symbols from le...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
This paper considers cost of logic circuits that implement Boolean functions. The realization of Boo...
AbstractThe average time of computing Boolean operators by straight-line programs of two types is st...
AbstractThe average time of computing Boolean functions by straight-line programs with a conditional...
AbstractThe average time of computing Boolean functions by straight-line programs with random number...
The Shannon function asymptotics for complexity of the parametric representation above any parametri...
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random...
AbstractThis paper presents an optimal bound on the Shannon function L(n,m,ε) that gives the worstca...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
A probabilistic algorithm is presented to calculate the Boolean product of two n × n Boolean matrice...
Abstract: The new exact bounds on the Shannon's functions characterizing the complexity of...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
This paper explores the connections between two areas pioneered by Shannon: the transmission of info...
AbstractWe consider the size of the representation of Boolean functions by several classes of binary...
A deterministic sequential device receives one input symbol at a time, prints output symbols from le...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
This paper considers cost of logic circuits that implement Boolean functions. The realization of Boo...
AbstractThe average time of computing Boolean operators by straight-line programs of two types is st...
AbstractThe average time of computing Boolean functions by straight-line programs with a conditional...
AbstractThe average time of computing Boolean functions by straight-line programs with random number...
The Shannon function asymptotics for complexity of the parametric representation above any parametri...
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random...
AbstractThis paper presents an optimal bound on the Shannon function L(n,m,ε) that gives the worstca...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
A probabilistic algorithm is presented to calculate the Boolean product of two n × n Boolean matrice...
Abstract: The new exact bounds on the Shannon's functions characterizing the complexity of...
We prove a lower bound of 4.5n - o(n) for the circuit complexity of an explicit Boolean function (th...
This paper explores the connections between two areas pioneered by Shannon: the transmission of info...
AbstractWe consider the size of the representation of Boolean functions by several classes of binary...
A deterministic sequential device receives one input symbol at a time, prints output symbols from le...
Bibliography: leaf 6.Research supported by the Army Research Office under contract DAAAG-29-84-K-005...
This paper considers cost of logic circuits that implement Boolean functions. The realization of Boo...
DOI
Add to ORKG