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 probabilistic algorithm is presented to calculate the Boolean product of two n × n Boolean matrice...
AbstractWe consider a fundamental problem in computational learning theory: learning an arbitrary Bo...
AbstractWe compare the complexities of Boolean functions for nondeterministic syntactic read-k-times...
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...
Abstract: The new exact bounds on the Shannon's functions characterizing the complexity of...
The Shannon function asymptotics for complexity of the parametric representation above any parametri...
We consider a parallel random access machine (PRAM) in which information is communicated via a share...
In contrast to machine models like Turing machines or random access machines, circuits are a rigid c...
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
We consider a parallel random access machine (PRAM) in which information is communicated via a share...
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean f...
A probabilistic algorithm is presented to calculate the Boolean product of two n × n Boolean matrice...
AbstractWe consider a fundamental problem in computational learning theory: learning an arbitrary Bo...
AbstractWe compare the complexities of Boolean functions for nondeterministic syntactic read-k-times...
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...
Abstract: The new exact bounds on the Shannon's functions characterizing the complexity of...
The Shannon function asymptotics for complexity of the parametric representation above any parametri...
We consider a parallel random access machine (PRAM) in which information is communicated via a share...
In contrast to machine models like Turing machines or random access machines, circuits are a rigid c...
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
We consider a parallel random access machine (PRAM) in which information is communicated via a share...
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean f...
A probabilistic algorithm is presented to calculate the Boolean product of two n × n Boolean matrice...
AbstractWe consider a fundamental problem in computational learning theory: learning an arbitrary Bo...
AbstractWe compare the complexities of Boolean functions for nondeterministic syntactic read-k-times...
DOI
Add to ORKG