FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2550662267> ?p ?o ?g. }

• W2550662267 endingPage "242" @default.
• W2550662267 startingPage "217" @default.
• W2550662267 abstract "(ProQuest: ... denotes formulae omitted.)I. IntroductionComputers have changed our world. exploding development of computational technology has brought algorithms into the spotlight and as a result, the analysis of algorithms has been gaining a lot of focus. An algorithm is a precise, systematic method for solving a class of problems. Algorithmic thinking, which is a form of mathematical thinking, refers to the thought processes associated with creating and analyzing algorithms. Both algorithms and algorithmic thinking are very powerful tools for problem solving and are considered to be key competences of students from primary to higher education (Capay and Magdin, 2013). An integral component of algorithmic thinking is the study of algorithmic which addresses the amount of resources necessary to execute an algorithm. Through analyzing the complexity of different algorithms, one can compare their efficiencies, their mathematical characteristics, and the speed at which they can be performed.The analysis of algorithmic complexity emerged as a scientific subject during the 1960's and has been quickly established as one of the most active fields of study. Today, algorithmic complexity theory addresses issues of contemporary concern including cryptography and data security, parallel computing, quantum computing, biological computing, circuit design, and the development of efficient algorithms (Homer and Selman, 2011). Lovasz (1996) writes complexity, I believe, should play a central role in the study of a large variety of phenomena, from computers to genetics to brain research to statistical mechanics. In fact, these mathematical ideas and tools may prove as important in the life sciences as the tools of classical mathematics (calculus and algebra) have proved in physics and chemistry (pg. 1).High School mathematics courses tend to be focused on preparing students for the study of calculus. Sylvia da Rosa (2004) claims that this has led students to the common misconception that mathematics is always continuous. In addition, few students are excited by pure mathematics. For most students to begin to appreciate mathematics, they have to see that it is useful. Incorporating the topic of algorithms in high school would afford teachers and students the opportunity to apply the mathematics they know to solve problems arising in everyday life, society and the workplace (CCSSI, 2010). Bernard Chazelle, a professor of computer science at Princeton University, in an interview in 2006 said on the future of computing: The quantitative sciences of the 21st century such as proteomics and neurobiology, I predict, will place algorithms rather than formulas at their core. In a few decades we will have algorithms that will be considered as fundamental as, say, calculus is today.Although there have been papers and books written on the history of algorithms, the history of algorithmic complexity has not been given nearly as much attention (Chabert, 1999; Cormen, et al., 2001). This paper will address this need by providing a history of algorithmic beginning with the text of Ibn al-majdi, a fourteenth century Egyptian astronomer, through the 21st century. In addition, this paper highlights the confusion surrounding big-O notation as well as the contributions of a group of mathematicians whose work in computability theory and complexity measures was critical to the development of the field of algorithmic complexity and the development of the theory of NP- Completeness (Knuth, 1976; Garey and Johnson, 1979). In effort to provide educators with context for which these topics can be presented, the problem of finding the maximum and minimum element in a sequence is introduced, along with an analysis of the complexity of two student-generated algorithms.II. History of Algorithmic ComplexityHistorically, an interest in optimizing arithmetic algorithms can be traced back to the Middle Ages (Chabert, 1999). …" @default.
• W2550662267 created "2016-11-30" @default.
• W2550662267 creator A5087393224 @default.
• W2550662267 date "2016-08-01" @default.
• W2550662267 modified "2023-09-28" @default.
• W2550662267 title "The history of Algorithmic complexity" @default.
• W2550662267 cites W1526664582 @default.
• W2550662267 cites W1539635882 @default.
• W2550662267 cites W1553917233 @default.
• W2550662267 cites W1597904065 @default.
• W2550662267 cites W1974040526 @default.
• W2550662267 cites W1985667642 @default.
• W2550662267 cites W1996489341 @default.
• W2550662267 cites W2000752995 @default.
• W2550662267 cites W2007815451 @default.
• W2550662267 cites W2011039300 @default.
• W2550662267 cites W2053913299 @default.
• W2550662267 cites W2066649761 @default.
• W2550662267 cites W2076515285 @default.
• W2550662267 cites W2110836275 @default.
• W2550662267 cites W2146766934 @default.
• W2550662267 cites W2400908863 @default.
• W2550662267 cites W2002252750 @default.
• W2550662267 cites W2891212941 @default.
• W2550662267 hasPublicationYear "2016" @default.
• W2550662267 type Work @default.
• W2550662267 sameAs 2550662267 @default.
• W2550662267 citedByCount "2" @default.
• W2550662267 countsByYear W25506622672020 @default.
• W2550662267 crossrefType "journal-article" @default.
• W2550662267 hasAuthorship W2550662267A5087393224 @default.
• W2550662267 hasConcept C11413529 @default.
• W2550662267 hasConcept C120665830 @default.
• W2550662267 hasConcept C121332964 @default.
• W2550662267 hasConcept C136197465 @default.
• W2550662267 hasConcept C154945302 @default.
• W2550662267 hasConcept C168167062 @default.
• W2550662267 hasConcept C192209626 @default.
• W2550662267 hasConcept C19754495 @default.
• W2550662267 hasConcept C26517878 @default.
• W2550662267 hasConcept C2777212361 @default.
• W2550662267 hasConcept C38652104 @default.
• W2550662267 hasConcept C41008148 @default.
• W2550662267 hasConcept C80444323 @default.
• W2550662267 hasConcept C97355855 @default.
• W2550662267 hasConceptScore W2550662267C11413529 @default.
• W2550662267 hasConceptScore W2550662267C120665830 @default.
• W2550662267 hasConceptScore W2550662267C121332964 @default.
• W2550662267 hasConceptScore W2550662267C136197465 @default.
• W2550662267 hasConceptScore W2550662267C154945302 @default.
• W2550662267 hasConceptScore W2550662267C168167062 @default.
• W2550662267 hasConceptScore W2550662267C192209626 @default.
• W2550662267 hasConceptScore W2550662267C19754495 @default.
• W2550662267 hasConceptScore W2550662267C26517878 @default.
• W2550662267 hasConceptScore W2550662267C2777212361 @default.
• W2550662267 hasConceptScore W2550662267C38652104 @default.
• W2550662267 hasConceptScore W2550662267C41008148 @default.
• W2550662267 hasConceptScore W2550662267C80444323 @default.
• W2550662267 hasConceptScore W2550662267C97355855 @default.
• W2550662267 hasIssue "3" @default.
• W2550662267 hasLocation W25506622671 @default.
• W2550662267 hasOpenAccess W2550662267 @default.
• W2550662267 hasPrimaryLocation W25506622671 @default.
• W2550662267 hasRelatedWork W112858668 @default.
• W2550662267 hasRelatedWork W1494942133 @default.
• W2550662267 hasRelatedWork W1527197079 @default.
• W2550662267 hasRelatedWork W1555854214 @default.
• W2550662267 hasRelatedWork W1994584977 @default.
• W2550662267 hasRelatedWork W2023352303 @default.
• W2550662267 hasRelatedWork W2148913933 @default.
• W2550662267 hasRelatedWork W2178626824 @default.
• W2550662267 hasRelatedWork W2331953749 @default.
• W2550662267 hasRelatedWork W2582697902 @default.
• W2550662267 hasRelatedWork W2763778230 @default.
• W2550662267 hasRelatedWork W2913688336 @default.
• W2550662267 hasRelatedWork W2923848533 @default.
• W2550662267 hasRelatedWork W3200447518 @default.
• W2550662267 hasRelatedWork W46971879 @default.
• W2550662267 hasRelatedWork W584898854 @default.
• W2550662267 hasRelatedWork W603975761 @default.
• W2550662267 hasRelatedWork W607971355 @default.
• W2550662267 hasRelatedWork W633254040 @default.
• W2550662267 hasRelatedWork W230702883 @default.
• W2550662267 hasVolume "13" @default.
• W2550662267 isParatext "false" @default.
• W2550662267 isRetracted "false" @default.
• W2550662267 magId "2550662267" @default.
• W2550662267 workType "article" @default.