Informational sensitivity as algorithm’s complexity function characteristic

Modelling of static mode characteristics of a thin-film vacuum nanotriode

“…Results are also applicable to field emission devices simulation [4][5][6][7][8][9][10][11][12][13]. Future work is characterisation of proposed algorithm's complexity function by informational sensitivity [14][15][16] measurements.…”

Confidence complexity of computer algorithms

“…It is developed by the authors of concorde and was chosen mostly because it is available for unrestricted educational and research use, although concorde can also use other libraries including commercial ones. The following random graph problems are studied: Non-Euclidean graphs with edge weight matrices that are filled with random numbers (non-geometrical problems): For data collection and for deciding what size of the sample would be representative we've used the same method as in [1], [3], where in parallel computations it is necessary to wait for each computational process to end and store the time value for its execution into the sample. For non-geometrical problems of size 1000 -10000 we've found the sample sizes and point characteristics as shown in table III.…”

“…More practically-oriented approach is measuring complexity in terms of time of execution of given algorithm on given computing system [1], [2], [3]. This approach is less general, but it has that advantage that it allows to test the computation speed of whole software complex and derive properties of the algorithm it's based on without having to study employed third-party libraries, packages and mathematical environments separately.…”