...TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top"> A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russ
1 KB (148 words) - 17:24, 7 February 2011
...d decoding algorithms that are close in their possibilities to the optimal algorithms whose existence has been proved in the theory of information transmission.
...bed on an intuitive level and have no clear mathematical description. Such algorithms always include learning processes with respect to a list of objects that ar
7 KB (993 words) - 17:28, 7 February 2011
In the theory of algorithms more special kinds of $tt$-reducibility are also considered, for instance b
...gn="top"> A.N. Degtev, "Reducibilities of tabular type in the theory of algorithms" ''Russian Math. Surveys'' , '''34''' : 3 (1979) pp. 155–192 ''Uspek
3 KB (414 words) - 21:57, 16 January 2016
...(ed.) ''The Schur complement and its applications'', Numerical Methods and Algorithms '''4''' Springer (2005) {{ISBN|0-387-24271-6}}{{ZBL|1075.15002}}
759 bytes (114 words) - 12:25, 12 November 2023
..., W.H. Payne, "Generalized feedback shift register pseudorandom number algorithms" ''J. ACM'' , '''20''' (1973) pp. 456–468</td></tr><tr><td valign="top
11 KB (1,696 words) - 19:30, 8 February 2024
The use of adaptive algorithms is now (1998) very widespread across such varied applications as system ide
The study of adaptive algorithms is generally made through the theory of [[Stochastic approximation|stochast
8 KB (1,242 words) - 15:31, 1 July 2020
...n the computational complexity of a problem; the analysis of all permitted algorithms together with the structure of a problem can provide lower bounds (cf. also
Consider a computational model for uniform algorithms over a set $\Sigma$. Two prominent examples are
7 KB (1,161 words) - 16:46, 1 July 2020
.../TD> <TD valign="top"> M. Minoux, "Mathematical programming: theory and algorithms" , Wiley (1986)</TD></TR>
1 KB (173 words) - 08:52, 25 April 2016
...hms with regular closure does not coincide with the set of actually stable algorithms, construction of a closed algorithm frequently helps in investigating the s
...>[6]</TD> <TD valign="top"> A.F. Shapkin, "Closure of two computational algorithms, based on the idea of orthogonalization" ''Zh. Vychisl. Mat. i Mat. Fiz.''
4 KB (651 words) - 17:23, 14 February 2020
...<TR><TD valign="top">[2]</TD> <TD valign="top"> A.A. Markov, "Theory of algorithms" , Israel Program Sci. Transl. (1961) (Translated from Russian) (Also: T
1 KB (172 words) - 16:25, 1 May 2014
...ly-increasing function from the natural numbers onto $A$. In the theory of algorithms the important characteristics of a direct counting of a set are recursivene
1 KB (167 words) - 11:07, 17 March 2023
...the transport problem and the assignment problem makes it possible to use algorithms that are more efficient than the [[Simplex method|simplex method]]. Some of
...<TD valign="top"> M. Grötschel, L. Lovász, A. Schrijver, "Geometric algorithms and combinatorial optimization" , Springer (1987)</TD></TR><TR><TD valign=
3 KB (453 words) - 18:48, 5 April 2020
...ersion of the first one. The methods of solution here consist of arbitrary algorithms and non-deterministic formally-describable procedures.
==Equivalent transformations of algorithms.==
15 KB (2,362 words) - 18:45, 27 April 2014
...discrete optimization problems are naturally formulated in terms of local algorithms.
The starting theorems for local algorithms are the uniqueness theorem and the theorem on the existence of a best algor
18 KB (2,562 words) - 18:06, 1 April 2020
...many geometric and analytical properties. There are elegant and efficient algorithms for evaluation, differentiation, subdivision of the curves, and conversion
...s that allows exact representation of conic sections. These properties and algorithms make the curves popular in areas where shape is important. In addition to C
5 KB (759 words) - 09:49, 27 March 2023
.... Combinatorial Gray codes are useful because they often lead to efficient algorithms for generating (i.e., listing) the objects. Some of the more important comb
...TD valign="top"> C.D. Savage, "Gray code sequences of partitions" ''J. Algorithms'' , '''10''' (1989) pp. 577–595</TD></TR><TR><TD valign="top">[a6]</TD>
7 KB (1,089 words) - 19:42, 5 June 2020
...hastic Lyapunov functions have been used to prove convergence of recursive algorithms driven by stochastic processes. Convergence problems of this type arise in
...Schuppen, "Convergence results for continuous-time stochastic filtering algorithms" ''J. Math. Anal. Appl.'' , '''96''' (1983) pp. 209–225</TD></TR></tab
5 KB (718 words) - 04:11, 6 June 2020
A basic concept in the branch of the theory of algorithms called enumeration theory, which investigates general properties of classes
...ation of this idea it was noticed that many known results in the theory of algorithms turn out to be consequences of general regularities in enumeration theory.
12 KB (1,899 words) - 19:37, 5 June 2020
...of abstract computers by other classes (e.g. in order to simulate parallel algorithms by sequential ones).
...ty of their structure and also by the type of information processed by the algorithms. The main classes of abstract computers are listed below.
9 KB (1,295 words) - 17:46, 4 June 2020
$#C+1 = 33 : ~/encyclopedia/old_files/data/A011/A.0101910 Algorithms, theory of
...[Turing machine|Turing machine]]). Subsequent development of the theory of algorithms is due to the studies of Kleene, Post [[#References|[6]]], [[#References|[7
19 KB (2,846 words) - 16:10, 1 April 2020