ITHEA Classification Structure > F. Theory of Computation > F.1 COMPUTATION BY ABSTRACT DEVICES > F.1.3 Complexity Measures and Classes
ITHEA Classification Structure > F. Theory of Computation > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY > F.2.1 Numerical Algorithms and Problems
Review of some problems on the complexity of simultaneous divisibility of linear
By: Nikolay K. Kosovskii, Mikhail Starchak (2665 reads)
Rating:
(1.00/10)
article:
Review of some problems on the complexity of simultaneous divisibility of linear
· CONSTRUCTION OF SOME COMPOSITION PERMUTATIONS VIA LINEAR TRANSLATORS
· A COMBINED EXTERIOR PENALTY FUNCTION – CONJUGATE GRADIENT ALGORITHM ...
· DIFFERENTIAL EVOLUTION – PARTICLE SWARM OPTIMIZATION
· ON THE COMPLEXITY OF SEARCH FOR CONJUNCTIVE RULES IN RECOGNITION PROBLEMS
· SELECTING CLASSIFIERS TECHNIQUES FOR OUTCOME PREDICTION ...
· MATRICIAL MODEL FOR THE STUDY OF LOWER BOUNDS
· OPTIMAL CONTROL OF A SECOND ORDER PARABOLIC HEAT EQUATION
· THE NEW SOFTWARE PACKAGE FOR DYNAMIC HIERARCHICAL CLUSTERING ...
·
|
Login World Clock |