The complexity of algorithms is considered in the paper aiming at the possibility investigation of the complexity characteristics improvement due to the giving the uniformity up. The investigation of the interconnection between a calculation time and program volume is also the aim of the paper. As a result obtaining methods for low estimations of the non-uniformal complexity through parameters of functions realized have been suggested. Quick non-uniformal algorithms for problems about shortest ways and multiplication of matrixes have been constructed. The paper results may find their field of application in mathematical cyberneticsAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.