Issue
Licensed
Unlicensed
Requires Authentication
Volume 6, Issue 5
Contents
-
Requires Authentication UnlicensedOn the class of weakly semiabelian polyadic groupsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedScheduling problem: complexity analysis and polynomially solvable subclassesLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn metric clusteringLicensedOctober 9, 2009
-
Requires Authentication UnlicensedInstantly solvable search problemsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn complete tests for contact circuits without quasi-repetitionsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn decidability of the completeness problem for special systems of automaton functionsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedA new version of the proof of completeness criterion for k-valued logic functionsLicensedOctober 9, 2009
