Issue
Licensed
Unlicensed
Requires Authentication
Volume 4, Issue 5
Contents
-
Requires Authentication UnlicensedLower cardinality-based estimates for the complexity of realization of functions from Pkby circuits of functional elements over an arbitrary basisLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn some closed classes in partial two-valued logicLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn realization of partitions of sets by circuits of functional elementsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedCoverings of Boolean graphsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the minimax path in a networkLicensedOctober 9, 2009
-
Requires Authentication UnlicensedProperties of matrices over a commutative ring related to the similarity relationLicensedOctober 9, 2009
-
Requires Authentication UnlicensedLower bounds for sums of characters over finite fieldsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the number of finite automata stabilized at a fixed state by a constant inputLicensedOctober 9, 2009
-
Requires Authentication UnlicensedErgodicity of conservative communication networksLicensedOctober 9, 2009
