...are the [[Semantics|semantical]] counterpart to the [[Signature (Computer Science)|signatures]], which are pure syntactical objects. In order to give the fu
...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
13 KB (2,332 words) - 14:56, 21 April 2013
...ynamic programming|dynamic programming]], discrete-event systems, computer science, discrete mathematics, [[Mathematical logic|mathematical logic]], etc. (see
...V.P. Maslov, "Correspondence principle for idempotent calculus and some computer applications" J. Gunawardena (ed.) , ''Idempotency'' , ''Publ. I. Newton I
18 KB (2,598 words) - 22:11, 5 June 2020
1805. Computer algorithms implementing this variant of the $LAR$ procedure
...), International Encyclopedia of Statistical Science. Heidelberg: Springer Science +Business Media, LLC.
7 KB (1,015 words) - 19:42, 1 November 2023
Sparse matrices can be kept in the computer's memory in a compact form, in which only the non-zero elements and their p
.... Shamir, "The efficiency of the simplex method: a survey" ''Management Science'' , '''33''' : 3 (1987) pp. 301–334</TD></TR><TR><TD valign="top">[a4]
8 KB (1,246 words) - 06:35, 7 May 2022
...r representation and the way in which they are stored in the memory of the computer. For composite values like arrays (vectors, matrices) and structured values
...m (representation of the program in the internal language of some abstract computer, which is convenient for the subsequent processing or execution of the prog
12 KB (1,804 words) - 16:56, 7 February 2011
...young computer scientists, Smolenice, Oct. 1986'' , ''Lect. notes in comp. science'' , '''281''' , Springer (1987) pp. 138–168</TD></TR>
13 KB (1,968 words) - 18:43, 26 March 2023
...al designs in general, and Steiner systems in particular, e.g. in computer science and cryptography [[#References|[a19]]].
...P.C. van Oorschot, "Applications of combinatorial designs in computer science" ''ACM Comp. Surveys'' , '''21''' (1989) pp. 223–250</TD></TR></table>
32 KB (4,451 words) - 15:16, 19 March 2018
...utation, quantum algorithms and their complexity, and quantum control. The science of quantum information processing is a highly interdisciplinary field. In t
...the introspective approach which led to the basic definitions of computer science and information theory as formulated by A. Church, A.M. Turing, C. Shannon
21 KB (3,030 words) - 16:52, 1 July 2020
manually or with the aid of an electronic computer. Thus, in the [[travelling salesman problem]] (which is a typical discrete
...bility theory]], [[Operations research|operations research]], and computer science. A number of benchmark references from the Western literature is given belo
10 KB (1,391 words) - 12:30, 17 February 2021
...nd find applications in combinatorics (enumerative graph theory), computer science (automata) and system and control theory (representation of the input-outpu
6 KB (1,093 words) - 08:26, 16 March 2023
computer support seems to be mandatory {{Cite|AJS}},{{Cite|J}},{{Cite|LV1}},{{Cite|L
...72 " Computer analysis of Sprouts"], Carnegie Mellon University Computer Science Technical Report No. CMU-CS-91-144, May 1991
19 KB (3,145 words) - 10:05, 18 February 2021
...th.org/legacyimages/b/b120/b120080/b12008026.png"/>-complexity in computer science: a Bayesian view" J.M. Bernardo (ed.) , ''Bayesian Statistics'' , North-Ho
6 KB (908 words) - 18:44, 21 March 2024
...hm is one of the central ideas in [[Cybernetics|cybernetics]] and computer science.
In science, algorithms are encountered everywhere: a "general" solution to a problem
18 KB (2,796 words) - 19:10, 11 December 2020
...) > \operatorname { log } _ { 2 } n \}$, which often arises in computer science (as it did in [[#References|[a9]]]) as part of an analysis of algorithmic c
7 KB (994 words) - 16:46, 1 July 2020
...n (ed.) , ''Coding Theory and Applications'' , ''Lecture Notes in Computer Science'' , '''388''' , Springer (1989) pp. 193–201</TD></TR><TR><TD valign="to
7 KB (1,070 words) - 19:40, 5 June 2020
...simulated annealing, tabu search and GRASP" , ''Lecture Notes in Computer Science'' , '''980''' , Springer (1995) pp. 317–331</TD></TR><TR><TD valign="to
10 KB (1,422 words) - 14:35, 19 May 2024
...a theory in computer science is analogous to that of philosophy in general science: it constitutes the stem from which the individual branches of knowledge em
...valign="top"> A. Salomaa, "Jewels of formal language theory" , Computer Science Press (1981)</TD></TR><TR><TD valign="top">[a14]</TD> <TD valign="top"> A
28 KB (4,202 words) - 08:53, 1 February 2020
...Thayse, "Boolean calculus of differences" , ''Lecture Notes in Computer Science'' , '''101''' , Springer (1981)</TD></TR><TR><TD valign="top">[a7]</TD> <T
8 KB (1,166 words) - 06:28, 30 May 2020
...inspiration, D$0$L-sequences have turned out to be useful in areas such as computer graphics and simulation of biological developments, see [[#References|[a5]]
...zenberg (ed.) A. Salomaa (ed.) , ''Current Trends in Theoretical Computer Science. Essays and Tutorials'' , World Sci. (1993) pp. 586–594</TD></TR>
10 KB (1,542 words) - 11:21, 26 March 2023
...nics. And though the physical realization of a Turing machine, the digital computer, actually uses quantum mechanics, its construction principles aims at the s
...ch, "Quantum theory, the Church-Turing principle and the universal quantum computer", Proceedings of the Royal Society of London A400(1985)97-117
27 KB (4,213 words) - 18:53, 26 April 2014