Search results

...8.</ref> when studying [[Upper and lower bounds|lower bounds]] in computer science named after [[Rasmus Pagh]]. In 2021 it was shown that, given popular conjectures, the naive linear time algorithm is optimal.<ref>Henzinger, Monika, et al. "Unifying and strengthe ...

{{Short description|Concept in theoretical computer science}} ...ved. The non-decreasing condition here means that the letters are received in the correct order. ...

...n | publisher = [[Springer-Verlag]] | series = [[Lecture Notes in Computer Science]] | volume = 443 | pages = [https://archive.org/details/automatalanguage000 ...> block of one path are labeled (<math>L(\sdot)</math>) the same as states in the <math>k^{\mathrm{th}}</math> block of the other path. Corresponding blo ...

..._Languages_II.html |archive-date=2019-10-31 |url-status=dead}}</ref> or in time <math>O(n+m)</math> if the automaton has ''n'' states and ''m'' transitions [[Category:Polynomial-time problems]] ...

{{Short description|Mathematical model in economics}} ...pdf Economic lot sizing: an O (n log n) algorithm that runs in linear time in the Wagner-Whitin case]." Operations Research 40.1-Supplement - 1 (1992): S ...

...needed|computer science|reason=contains buzzwords that should be explained in a less technical manner|date=July 2017}} ...ef> ATL uses [[alternating-time formulas]] to construct [[model-checker]]s in order to address problems such as receptiveness, realizability, and control ...

...<math>(n^2)</math> combinations each of which takes O<math>(n)</math> time in the worst case. ...

{{about|the area in computer science|the area in applied mathematics|Structural complexity (applied mathematics)}} ...hierarchy.svg|250px|thumb|right|Pictorial representation of the polynomial time hierarchy. The arrows denote inclusion.]] ...

In [[computer science]], the '''Helman-Bader-JaJa model''' *<math>m</math> is number of machine words in a packet sent over the network. ...

...g]]. It is a single variable model combining [[temperature]] (''T'') and [[time]] (''t'') and assuming that the delignification is one single [[Chemical re |series=Papermaking Science and Technology ...

...r refers to a relatively sinusoidal motion during the integration/exposure time. ...he spatial frequency and <math>\alpha</math> is the amplitude of the smear in pixels.<ref>{{cite journal|last=Johnson|first=Jerris F.|title=Modeling imag ...

...g]] where lookups are performed on a finalized dictionary set (all objects in the dictionary are final and not changing). ...omputing, Hashing Unit | publisher = United States Naval Academy, Computer Science Department | url = http://www.usna.edu/Users/cs/roche/courses/s13si486d/u04 ...

...ter scientist, and textbook author. She is a professor emerita of computer science at [[Indiana University–Purdue University Indianapolis]]{{r|iupui}} and at ...tson University]] in 1962,{{r|green}} and completed a Ph.D. in mathematics in 1969 at [[Arizona State University]]. Her dissertation, ''Some Results on < ...

...humb|upright|[[Galileo]]'s demonstration of the law of the space traversed in case of uniformly varied motion. It is the same demonstration that [[Oresme ...rce Book in Medieval Science'' (1974) Vol. 1, p. 252.</ref> was discovered in the 14th century by the [[Oxford Calculators]] of [[Merton College]], and w ...

...sertion, query of the minimum element, and deletion of the minimum element in any of the k dimensions, and therefore includes the [[Double-ended priority ...each has <math>k</math> keys (or priorities), the K-D heap organizes them in to a [[binary tree]] which satisfies two conditions: ...

{{Short description|Science book series written by scientists and published by Princeton University Pre ...ton Science Library |url=https://press.princeton.edu/collections/princeton-science-library |website=press.princeton.edu |language=en}}</ref> ...

...for his work on [[graph algorithm]]s and [[parameterized complexity]] and in particular for algorithms relating to [[tree decomposition]] of graphs. ...ekom]], Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of [[Jan van Leeuwen]] with the thesis ''Distrib ...

{{Short description|Computation which does not terminate or terminates in an exceptional state}} ...productive (i.e. to continue producing an action within a finite amount of time). ...

{{Network science}} ...science]], the '''activity-driven model''' is a [[temporal network]] model in which each node has a randomly-assigned "activity potential",<ref name="per ...

...may be positive or negative or zero) has a [[Cycle (graph theory)|cycle]] in which the sum of weights is&nbsp;0. ...blem, on graphs with no negative cycle, has a [[polynomial time|polynomial-time]] algorithm.{{r|ss}} ...