Matches in SemOpenAlex for { <https://semopenalex.org/work/W2002194240> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2002194240 endingPage "250" @default.
- W2002194240 startingPage "249" @default.
- W2002194240 abstract "When the concept of the algorithm was formalized in mathematics and then adopted in computer science, one of the main assumptions was that an algorithm has to be deterministic. For instance, in such a fundamental book as [1], the following definition is given: Algorithm is a clerical (i.e., deterministic, bookkeeping) procedure which can be applied to any of a certain class of symbolic inputs and which will eventually yield, for each such input, a corresponding output. This understanding corresponded only deterministic theoretical models (Turing machines, λ-calculus, partial recursive functions etc.) to the notion of the algorithm. Moreover, those algorithms that were used in mathematics for millennia (for example, Euclid's algorithm) also supported the idea that an algorithm has to be deterministic. However, mathematicians and computer scientists found that the idea of algorithm is much broader than the deterministic restriction allows. As a result, randomness came into the algorithmic realm. In theory, it came, at first, in the guise of non-deterministic computational models (non-deterministic finite automata attributed to [2], pushdown automata [3, 4], non-deterministic Turing machines etc.) and then as probabilistic models (probabilistic Turing machines [5], probabilistic finite automata [6], etc.). In practice, probabilistic algorithms appeared even earlier than in theory. The first design and utilization of probabilistic algorithms under the name Monte Carlo methods is attributed to Ulam and Metropolis who in 1940s applied these methods to numerical problems in Los Alamos. However, this was at an empirical level, while the first theoretically grounded probabilistic algorithm was suggested by Solovay and Strassen [7] for finding whether a number is prime or not." @default.
- W2002194240 created "2016-06-24" @default.
- W2002194240 creator A5000852304 @default.
- W2002194240 date "2005-11-29" @default.
- W2002194240 modified "2023-09-25" @default.
- W2002194240 title "Juraj Hromkovic Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. Series: Texts in Theoretical Computer Science. An EATCS Series. Springer (2005). ISBN 3-540-23949-9. £30.50/€39.95/$49.95. 274 pp. Hardbound." @default.
- W2002194240 cites W1964053266 @default.
- W2002194240 cites W1982581840 @default.
- W2002194240 cites W2054801208 @default.
- W2002194240 cites W4212875940 @default.
- W2002194240 cites W4234891673 @default.
- W2002194240 cites W4238569895 @default.
- W2002194240 doi "https://doi.org/10.1093/comjnl/bxh148" @default.
- W2002194240 hasPublicationYear "2005" @default.
- W2002194240 type Work @default.
- W2002194240 sameAs 2002194240 @default.
- W2002194240 citedByCount "0" @default.
- W2002194240 crossrefType "journal-article" @default.
- W2002194240 hasAuthorship W2002194240A5000852304 @default.
- W2002194240 hasConcept C105795698 @default.
- W2002194240 hasConcept C11413529 @default.
- W2002194240 hasConcept C125112378 @default.
- W2002194240 hasConcept C128669082 @default.
- W2002194240 hasConcept C143724316 @default.
- W2002194240 hasConcept C151730666 @default.
- W2002194240 hasConcept C154945302 @default.
- W2002194240 hasConcept C24404364 @default.
- W2002194240 hasConcept C29248071 @default.
- W2002194240 hasConcept C33923547 @default.
- W2002194240 hasConcept C41008148 @default.
- W2002194240 hasConcept C45374587 @default.
- W2002194240 hasConcept C49937458 @default.
- W2002194240 hasConcept C80444323 @default.
- W2002194240 hasConcept C86803240 @default.
- W2002194240 hasConceptScore W2002194240C105795698 @default.
- W2002194240 hasConceptScore W2002194240C11413529 @default.
- W2002194240 hasConceptScore W2002194240C125112378 @default.
- W2002194240 hasConceptScore W2002194240C128669082 @default.
- W2002194240 hasConceptScore W2002194240C143724316 @default.
- W2002194240 hasConceptScore W2002194240C151730666 @default.
- W2002194240 hasConceptScore W2002194240C154945302 @default.
- W2002194240 hasConceptScore W2002194240C24404364 @default.
- W2002194240 hasConceptScore W2002194240C29248071 @default.
- W2002194240 hasConceptScore W2002194240C33923547 @default.
- W2002194240 hasConceptScore W2002194240C41008148 @default.
- W2002194240 hasConceptScore W2002194240C45374587 @default.
- W2002194240 hasConceptScore W2002194240C49937458 @default.
- W2002194240 hasConceptScore W2002194240C80444323 @default.
- W2002194240 hasConceptScore W2002194240C86803240 @default.
- W2002194240 hasIssue "2" @default.
- W2002194240 hasLocation W20021942401 @default.
- W2002194240 hasOpenAccess W2002194240 @default.
- W2002194240 hasPrimaryLocation W20021942401 @default.
- W2002194240 hasRelatedWork W1670010702 @default.
- W2002194240 hasRelatedWork W1946344130 @default.
- W2002194240 hasRelatedWork W2160232022 @default.
- W2002194240 hasRelatedWork W2502089238 @default.
- W2002194240 hasRelatedWork W2548393475 @default.
- W2002194240 hasRelatedWork W2569189913 @default.
- W2002194240 hasRelatedWork W2950895754 @default.
- W2002194240 hasRelatedWork W3205048609 @default.
- W2002194240 hasRelatedWork W951880993 @default.
- W2002194240 hasRelatedWork W2413884661 @default.
- W2002194240 hasVolume "49" @default.
- W2002194240 isParatext "false" @default.
- W2002194240 isRetracted "false" @default.
- W2002194240 magId "2002194240" @default.
- W2002194240 workType "article" @default.