Issue
Licensed
Unlicensed
Requires Authentication
Volume 7, Issue 2
Contents
-
Requires Authentication UnlicensedOn the complexity and depth of circuits that realize partial Boolean functionsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn some properties of algebras with simple multiplication containing associative subalgebrasLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the structure of the lattice of closed classes of polynomialsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedCodes and designsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the minimal packing of a tree with fixed verticesLicensedOctober 9, 2009
-
Requires Authentication UnlicensedCharacterization of some extremal graphs with diameter no greater than threeLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the traversal of labyrinths by automata leaving unremovable labelsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedApproximate models of permutational automataLicensedOctober 9, 2009
-
Requires Authentication UnlicensedLimit theorems for the number of empty cellsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedFourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’LicensedOctober 9, 2009
