Find link

language:

Find link is a tool written by Edward Betts.

searching for Algorithmic efficiency 10 found (189 total)

Edmonds–Karp algorithm (866 words) [view diff] exact match in snippet view article find links to article

Edmonds, Jack; Karp, Richard M. (1972). "Theoretical improvements in algorithmic efficiency for network flow problems" (PDF). Journal of the ACM. 19 (2): 248–264

Euclidean algorithm (15,118 words) [view diff] no match in snippet view article find links to article

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers

Gabriel Lamé (551 words) [view diff] exact match in snippet view article find links to article

chaleur (Mallet-Bachelier) Lamé’s Theorem Euclidean algorithm (Algorithmic efficiency) Lamé crater Piet Hein Julius Plücker Helmholtz equation Proof of

Minimum-cost flow problem (1,238 words) [view diff] exact match in snippet view article find links to article

Edmonds & Richard M. Karp (1972). "Theoretical improvements in algorithmic efficiency for network flow problems". Journal of the ACM. 19 (2): 248–264

Turing Award (3,519 words) [view diff] exact match in snippet view article find links to article

identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness

Tamás Terlaky (1,595 words) [view diff] exact match in snippet view article find links to article

Excellence in Operations Research Practice for helping to improve algorithmic efficiency at the Pennsylvania Department of Corrections by creating the unique

List of pioneers in computer science (1,515 words) [view diff] exact match in snippet view article find links to article

identified polynomial-time computability with the intuitive notion of algorithmic efficiency; contributed to the theory of NP-completeness 1973 Karpinski, Jacek

Hungarian algorithm (5,552 words) [view diff] case mismatch in snippet view article find links to article

Jack; Karp, Richard M. (1 April 1972). "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems". Journal of the ACM. 19 (2): 248–264

Degree-Rips bifiltration (1,381 words) [view diff] exact match in snippet view article find links to article

outperforms other persistent homology software. Methods of improving algorithmic efficiency of multiparameter persistent homology have also been explored that

List of University of California, Berkeley faculty (15,272 words) [view diff] exact match in snippet view article find links to article

identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness