Issue
Licensed
Unlicensed
Requires Authentication
Volume 1, Issue 4
Contents
-
Requires Authentication UnlicensedThe Newton sums method in combinatorial optimizationLicensedOctober 8, 2009
-
Requires Authentication UnlicensedKerdock code in a cyclic formLicensedOctober 8, 2009
-
Requires Authentication UnlicensedOn the conditions of regularity for finite autonomous automataLicensedOctober 8, 2009
-
Requires Authentication UnlicensedOn lower bounds for the time of computationLicensedOctober 8, 2009
-
Requires Authentication UnlicensedStochasticity of the languages acceptable by two-way finite probabilistic automataLicensedOctober 8, 2009
-
Requires Authentication UnlicensedOn completeness of the binary boundedly determined functions with respect to superpositionLicensedOctober 8, 2009
-
Requires Authentication UnlicensedWeighings, allocations, and the embeddability of partitionsLicensedOctober 8, 2009
-
Requires Authentication UnlicensedOn the circle methodLicensedOctober 8, 2009
-
Requires Authentication UnlicensedDistribution of the permanent of a random Boolean matrixLicensedOctober 8, 2009
