...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
...been constructed, based on certain intuitive principles, i.e. families of algorithms for solving classification problems. The most widely used are: models based
...ication is a priori known. In developing the general theory of recognition algorithms the most complete results have been obtained within an algebraic framework.
8 KB (1,189 words) - 13:43, 17 April 2014
...<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
2 KB (216 words) - 17:08, 7 February 2011
One of the basic concepts in the [[Algorithms, theory of|theory of algorithms]] and its applications. Its background was the fact that solvability (and u
...so-called priority method, which is extensively employed in the theory of algorithms.
6 KB (862 words) - 19:26, 22 January 2016
...ecial method for constructing algorithms based on the requirement that the algorithms should be exact or have an error of prescribed order of accuracy on some se
4 KB (621 words) - 11:59, 12 August 2014
...[[Automatic programming|automatic programming]] and for the publication of algorithms (it is an abbreviation of "ALGOrithmic Language" ).
...lly refers to "Algol-60" . It is especially suited for the description of algorithms of numerical analysis. The language is machine-independent and does not pro
4 KB (632 words) - 17:21, 7 February 2011
...]. The Scarf algorithm and other related ones rapidly evolved into various algorithms for solving equations, for finding extrema and for tracing bifurcating solu
...as a very extensive bibliography. A substantial number of previously known algorithms for solving equations can be obtained as particular cases of the homotopy c
9 KB (1,325 words) - 17:26, 7 February 2011
...nald E. Knuth, ''The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1'', Addison-Wesley (2014) {{ISBN|0133488853}}
1 KB (199 words) - 14:15, 12 November 2023
there are algorithms which are particularly convenient in practice. There is a considerable numb
...>[a4]</TD> <TD valign="top"> D.F. Elliot, K.R. Rao, "Fast transforms: algorithms, analysis, applications" , Acad. Press (1982)</TD></TR>
4 KB (602 words) - 14:32, 17 March 2023
...computable functions and theory of algorithms (cf. [[Algorithms, theory of|Algorithms, theory of]]; [[Computable function|Computable function]]) is any mapping o
6 KB (919 words) - 08:26, 6 June 2020
* Rajeev Motwani, Prabhakar Raghavan, "Randomized Algorithms", Cambridge University Press (1995) {{ISBN|978-0-521-47465-8}} {{ZBL|0849.6
1 KB (226 words) - 07:28, 14 November 2023