Search results

...=10.1.1.55.5669}}</ref> The number of children at a node from each leaf to root is 0,2,2,4,16, 256, 65536, ... {{OEIS|id=A001146}} ...://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5650 Cache-Oblivious Algorithms]. Masters thesis, MIT. 1999.</ref> ...

...10.1109/TCS.1979.1084580 | title = A new algorithm for computing a single root of a real continuous function | journal = IEEE Transactions on Circuits and ...terates is <math>\sqrt{2}</math>. If the function is not well-behaved, the root remains bracketed and the length of the bracketing interval at least halves ...

...lar, it has numerous applications in [[Root-finding algorithm|root finding algorithms]] like [[Newton's method]] and its generalization [[Householder's method]]. ...

'''Sidi's generalized secant method''' is a [[root-finding algorithm]], that is, a [[numerical method]] for solving [[equations]] of t We call <math>\alpha</math> the root of <math>f</math>, that is, <math>f(\alpha)=0</math>. Sidi's method is an i ...

...More generally, we can find a polynomial <math>f(x)</math> with the same root <math>x_0</math> modulo some power <math>M^a</math> of {{mvar|M}}, satisfyi ...ynomials <math>p_1(x), p_2(x), \dots, p_n(x)</math> that all have the same root <math>x_0</math> modulo <math>M^a</math>, where {{mvar|a}} is some integer ...

...nteger, then the solution is <math>x=r_k,y=s</math>; otherwise try another root of {{math|-''d''}} until either a solution is found or all roots have been Solve the equation <math>x^2+6y^2=103</math>. A square root of &minus;6&nbsp;(mod&nbsp;103) is 32, and 103&nbsp;≡&nbsp;7&nbsp;(mod&nbsp ...

{{Short description|Root-finding algorithm}} ...Truncate and Project method'') is the first [[Root-finding algorithms|root-finding algorithm]] that achieves the [[superlinear convergence]] of the [[secant m ...

...ure]] designed to solve [[anagram]]s. Solving an anagram is the problem of finding a word from a given list of letters. These problems are commonly encountere ...>n_1</math>, <math>n_2</math> ... <math>n_l</math>, then the path from the root to the leaf along these vertices and edges are a list of words that contain ...

...The edges connecting the subgraphs to the root node are called ''gates''. Finding the [[optimal solution]] is [[NP-hard]].<ref>{{citation | title = Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Netwo ...

{{broader|Root-finding algorithms}} Finding [[polynomial root]]s is a long-standing problem that has been the object of much research thr ...

...an | first1 = R.E. | last2 = Vishkin | first2 = U. | year = 1984 | title = Finding biconnected components and computing tree functions in logarithmic parallel ...ly]]. (Here we assume that the nodes of the tree are ordered, and that the root is the first element in this order.) ...

...the best path.<ref name=yenksp2>{{cite journal|last=Yen|first=Jin Y.|title=Finding the ''k'' Shortest Loopless Paths in a Network|journal= Management Science| | <math>{R^k}_i</math> || The root path of <math>{A^k}_i</math> that follows that <math>A^{k-1}</math> until t ...

...patch that introduced a [[software bug|bug]]. Another application area is finding the patch that indirectly fixed a bug. Bisection is in [[L (complexity)|LSPACE]] having an [[Analysis of algorithms|algorithmic complexity]] of <math>O(\log N)</math> with <math>N</math> deno ...

...979.<ref name=":1">{{cite journal |author = M. Rabin |title= Probabilistic Algorithms in Finite Fields |journal= SIAM Journal on Computing |year= 1980 |volume= 9 ...0/s0025-5718-2011-02419-1 |arxiv =0812.2591 |s2cid= 10249895 }}</ref> for finding square roots in <math>\mathbb F_p</math>.<ref>{{cite journal |author = R. P ...

...ist-style=amp |url=http://people.ee.duke.edu/~lcarin/liu06a.pdf |title=New Algorithms for Efficient High-Dimensional Nonparametric Classification|journal=Journal & \text{if }B \neq Root \\ ...

...r|ggpdc20}}, [[Polynomial division|division]],{{r|ggpdc21}} [[root-finding algorithms]],{{r|pan}} and [[polynomial greatest common divisor]]s.{{r|zippel}} Sparse | contribution = Acceleration of subdivision root-finding for sparse polynomials ...

...at can determine the ancestor of a given node at a given distance from the root of the tree. ...e ''v'' in a tree is the number of edges on the [[shortest path]] from the root of the tree to node&nbsp;''v''. ...

...''&prime; of {{math|''V''&nbsp;\{{mset|''L''}}}}. Node ''L'' is called the root of arborescence. An arborescence is a spanning arborescence if {{math|1=''V * dividing into two sets with median-finding algorithms in ''O''(''E'') ...

...lgorithms have been devised for computing an approximate fixed point. Such algorithms are used in economics for computing a [[market equilibrium]], in [[game the ...ecisely, since it can be an arbitrary real number. Fixed-point computation algorithms look for ''approximate'' fixed points. There are several criteria for an ap ...

The problem of finding the sink in a unique sink orientation of a hypercube was formulated as an a ...nk using a randomized algorithm in expected time exponential in the square root of ''d'' {{harv|Gärtner|2002}}. ...