Search results

...encryption]], this still represents a relatively low [[level of security]] in the context of a [[brute force attack]]. ...trol Act]] until control was transferred to the [[Department of Commerce]] in 1996. ...

...s a sequence of lines. To this day, variations of this algorithm are found in incremental [[version control system]]s, [[wiki software|wiki engine]]s, an ...man, J. |journal=Journal of the ACM |pages=1–12 |volume=23 |number=1 |year=1976 |doi=10.1145/321921.321922 |s2cid=10957346 |issn=0004-5411 }}</ref><ref>See ...

...inued at Newcastle as a graduate student and completed her doctorate there in 1979.{{r|pouliot|mgp}} Her dissertation, "Some problems on combinatorial ar ...later "Discover the Possibilities", a shopping-center exhibit called "Math in the Malls", and a series of national conferences on mathematics education. ...

...t of ''n'' points in the [[plane (mathematics)|plane]] (or more generally, in <math>\mathbb{R}^{d}</math>) is a [[minimum spanning tree]] of that set, wh ...an be found using existing algorithms for finding a minimum spanning tree. In particular, using [[Prim's algorithm]] with an [[adjacency matrix]] yields ...

In computational mathematics, the Hadamard ordered '''fast Walsh–Hadamard tran ...actions on Computers |volume=25 |issue=11 |pages=1142–1146 |doi=10.1109/TC.1976.1674569 |s2cid=13252360 }}</ref> This implementation follows the recursive ...

...lic order''' is a [[ternary relation]] that generalizes a [[cyclic order]] in the same way that a [[partial order]] generalizes a [[linear order]]. ...' or ''cba''; either attempt would result in a contradiction.{{sfn|Megiddo|1976|pp=274–275}} ...

'''Magnussen model''' is a popular method for computing reaction rates as a function of both mean concentrations and [[turbulence]] ...ath>, is governed by the local mean species concentrations and temperature in the following way: ...

A '''segment''' of a system variable in [[computing]] shows a homogenous status of [[system dynamics]] over a time period. Her ...nt segment''' is a special class of the constant segment with a constraint in which the constant segment is either one of a timed event or a null-segment ...

In [[graph theory]], a branch of mathematics, the '''rank''' of an [[undirecte * In the [[matrix theory]] of graphs the rank {{math|''r''}} of an undirected gr ...

...a computational problem in the mathematical study of [[graph algorithm]]s, in which the input is a [[directed graph]] and the goal of the problem is to a ...on of the problem is NP-complete, but the unweighted problem can be solved in [[linear time]].{{r|et76}} Subsequent research has considered the [[approxi ...

...r his work on matching geometric shapes, including methods for efficiently computing the [[Fréchet distance]] between shapes. He was also the first to use the G ...urt Mehlhorn]] at [[Saarland University]], where he completed his Ph.D. in 1976 on algorithms for parsing [[context-free language]]s.{{r|mg}} ...

...=Frucht Graph|mode=cs2}}</ref> It was first described by [[Robert Frucht]] in 1939.<ref name="f38"/> .../publications/computer-investigation-of-cubic-graphs|volume=76-WSK-01|year=1976}}</ref> (that is, every vertex can be distinguished topologically from ever ...

...right=1.3|The order-4 shuffle-exchange network, with its vertices arranged in numerical order]] In [[graph theory]], the '''shuffle-exchange network''' is an [[undirected gra ...

In [[computing]] and [[information science]], the '''Binary Independence Model''' ('''BIM' ...the set of relevant documents and they are also independently distributed in the set of irrelevant documents. ...

...gth of the schedule (that is, when all the jobs have finished processing). In the specific variant known as ''flow-shop scheduling'', each job contains e ...p scheduling problem is the '''permutation flow-shop scheduling''' problem in which the [[Process (engineering)|processing]] order of the jobs on the res ...

{{Short description|Computing the fixed point of a function}} ...quilibrium]], in [[game theory]] for computing a [[Nash equilibrium]], and in [[dynamic system]] analysis. ...

...partite graph]]s and finding [[Arborescence (graph theory)|arborescence]]s in [[directed graph]]s. ...s theorem, the matroid intersection problem for two matroids can be solved in polynomial time using [[matroid partitioning]] algorithms. ...

In [[arithmetic]] and [[algebra]] the '''sixth power''' of a [[number]] ''n'' In this way, they are analogous to two other classes of [[figurate number]]s: ...

| death_date = {{death date and age |1976|11|15|1902|06|16}} '''Gheorghe Călugăreanu''' (16 June 1902 – 15 November 1976) was a Romanian mathematician, professor at [[Babeș-Bolyai University]], an ...

.../ref><ref name="numerical-recipes-c++">{{cite book|title=Numerical Recipes in C++| pages=177–179|isbn= 0 521 75033 4}}</ref> ...he denominator by a very small number as suggested by Thompson and Barnett in 1986.<ref name="Thompson-and-Barnett">{{Cite journal|last1=Thompson|first1= ...