Search results

...8.</ref> when studying [[Upper and lower bounds|lower bounds]] in computer science named after [[Rasmus Pagh]]. ...problem.<ref>Patrascu, Mihai. "Towards polynomial lower bounds for dynamic problems." Proceedings of the forty-second ACM symposium on Theory of computing. 201 ...

...lar_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'' transi [[Category:Polynomial-time problems]] ...

In [[mathematical logic]] and [[computer science]], '''two-variable logic''' is the [[fragment (logics)|fragment]] of [[firs ...isfiability (logics)|finite satisfiability]], are [[decidability (computer science)|decidable]].<ref>E. Grädel, P.G. Kolaitis and M. Vardi, ''On the Decision ...

{{Short description|Unsolved problem in theoretical computer science}} In [[theoretical computer science]], the '''log-rank conjecture''' states that the deterministic [[communicat ...

...versity of Technology]] and [[Okayama University]], known for his research in [[formal language]] theory. In 1988, he found the first [[algorithm]] to determine the [[star height]] of ...

{{about|the area in computer science|the area in applied mathematics|Structural complexity (applied mathematics)}} ...nguages and Programming]], 1988 (ICALP 88), ''[[Lecture Notes in Computer Science]]'', vol. 317 (1988), pp. 271-286.</ref> ...

...LEMENTARY}</math> consists of the [[decision problem]]s that can be solved in time bounded by an [[elementary recursive function]]. The most quickly-grow \mathsf{ELEMENTARY} & = \bigcup_{k \in \mathbb{N}} k\mathsf{\mbox{-}EXP} \\ ...

In mathematics, a '''sum of radicals''' is defined as a finite [[linear combin ...]], since the computation of the [[Euclidean distance]] between two points in the general case involves the computation of a [[square root]], and therefo ...

{{Short description|Set of related problems in graph theory}} ...tion planning]] (in which the pebbles are robots) and [[network routing]] (in which the pebbles are [[Data packet|packets]] of data). The best-known exam ...

...er, used to relate the difficulty of improving the time bounds for the two problems. ...solved in time <math>a(n)</math> and problem <math>B</math> can be solved in time <math>b(n)</math>, then the existence of an <math>(a,b)</math>-reducti ...

{{short description|American computer scientist}} ...eory]], and [[computer science education]]. She is a professor of computer science at the [[University of Kentucky]]. ...

{{Short description|Dutch computer scientist}} ...for his work on [[graph algorithm]]s and [[parameterized complexity]] and in particular for algorithms relating to [[tree decomposition]] of graphs. ...

{{Short description|Technique to solve constraint satisfaction problems}} ...that are consistent with the constraints. If two variables ''A'' and ''B'' in a CSP may be swapped for each other (that is, ''A'' is replaced by ''B'' an ...

...ime before outputting the first solution. This complexity can be expressed in terms of the size of the input, the size of each individual output, or the ...[[String (computer science)|strings]] of an arbitrary [[Alphabet (computer science)|alphabet]] <math>\Sigma</math>: ...

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

{{Short description|Theoretical computer scientist}} {{about|computer scientist}} ...

{{Short description|Measure of delay in executing certain operations}} ...ing (disambiguation)|scheduling]], '''tardiness''' is a measure of a delay in executing certain operations and '''earliness''' is a measure of finishing ...

...it in a 1983 conference and published it in the ''[[Journal of the ACM]]'' in 1994. ...in a feasible solution. This technique has given PTASs for the following problems: [[subgraph isomorphism]], [[maximum independent set]], [[minimum vertex co ...

...]s named after [[Nachum Dershowitz]] and [[Zohar Manna]]. It is often used in context of termination of programs or [[abstract rewriting system|term rewr ...he set of all finite multisets on <math>S</math>. For multisets <math>M,N \in \mathcal{M}(S)</math> we define the Dershowitz–Manna ordering <math>M <_{DM ...

...ruction, and the construction of shape models in [[3d computer graphics|3D computer graphics]] (such as the [[Stanford bunny]], a popular 3D model). The steps of the interpolation method (in three dimensions) are as follows: ...