...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
...programming language has a universal character, allowing one to formulate algorithms for solving various problems that are to be solved on different computers.
4 KB (544 words) - 08:07, 6 June 2020
* Rajeev Motwani, Prabhakar Raghavan, "Randomized Algorithms", Cambridge University Press (1995) {{ISBN|978-0-521-47465-8}} {{ZBL|0849.6
1 KB (173 words) - 07:29, 14 November 2023
...ctionals. In discrete programming the algorithms employed are analogues of algorithms of local optimization, descent, random search, etc. For a review of approxi
...to find the extremum or a good approximation to it in the class of simple algorithms; this collection is often effectively described. This was first noted in so
10 KB (1,391 words) - 12:30, 17 February 2021
...such as the memory management aspects and computational complexity of such algorithms (cf. also [[Complexity theory]] and [[Algorithm, computational complexity o
<TR><TD valign="top">[a3]</TD> <TD valign="top"> H. Edelsbrunner, "Algorithms in combinatorial geometry" , Springer (1987)</TD></TR>
5 KB (738 words) - 19:10, 17 December 2015
<TR><TD valign="top">[1]</TD> <TD valign="top"> A.A. Markov, "Theory of algorithms" , Israel Program Sci. Transl. (1961) (Translated from Russian) (Also: T
...lign="top"> A.A. Markov, N.M. [N.M. Nagornyi] Nagorny, "The theory of algorithms" , Kluwer (1988) (Translated from Russian) {{ZBL|0663.03023}}</TD></TR>
3 KB (544 words) - 07:12, 10 November 2023
...used method for abbreviating proofs, and is often useful in improving the algorithms for the establishment of derivability. One of the most important results in
1 KB (207 words) - 19:21, 17 October 2014
...s present no difficulties). Also, rational numbers, algebraic polynomials, algorithms, and calculi of various well-defined types (cf. [[Algorithm|Algorithm]]; [[
...lign="top"> A.A. Markov, N.M. [N.M. Nagornyi] Nagorny, "The theory of algorithms" , Reidel (1988) (Translated from Russian) {{ZBL|0663.03023}}</TD></TR>
4 KB (587 words) - 20:53, 8 December 2015
There are efficient algorithms to solve this problem. Let $ X $
...valign="top">[a9]</TD> <TD valign="top"> J. Kennington, R. Helgason, "Algorithms for network programming" , Wiley (1980)</TD></TR></table>
7 KB (1,074 words) - 20:15, 15 March 2023
...mathematical logic — the theory of algorithms (cf. [[Algorithms, theory of|Algorithms, theory of]]). The growing stream of information and the related problems o
...re of discrete analysis, related to problems in finite structures, is that algorithms by which these problems may be solved exist in most cases, while in classic
9 KB (1,264 words) - 16:56, 15 April 2012
* Eric Bach, Jeffrey O. Shallit, ''Algorithmic Number Theory: Efficient algorithms, Volume 1'', MIT Press (1996) {{ISBN|0262024055}}
1 KB (186 words) - 16:57, 25 November 2023