Issue
Licensed
Unlicensed
Requires Authentication
Volume 2, Issue 3
Contents
-
Requires Authentication UnlicensedOn perfect codes in deletion and insertion metricLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the complexity of approximate computation of real numbers by schemes and formulae in different rational basesLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn regular languages with polynomial growth of the number of wordsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedUpper bounds for the exponents of pseudo-symmetric graphsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the relationship between the optima of linear and integer linear programmingLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the complexity of sorting problem for a Boolean algebraLicensedOctober 9, 2009
-
Requires Authentication UnlicensedA lower bound for time complexity of the integer problem on uniqueness of elementsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn sufficient conditions for asymptotic normality of decomposable statistics in a non-homogeneous allocation schemeLicensedOctober 9, 2009
-
Requires Authentication UnlicensedSampling sums of dependent random variables, mixtures of infinitely divisible laws and branching random processesLicensedOctober 9, 2009
