Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Thuật toán thiên hà · Vinony

🌐Tiếng Việt

English Deutsch Español Français Italiano Português Tiếng Việt Русский 中文

EntityQ65072234· pop 7· linked from 10 articles

Thuật toán thiên hà

algorithm asymptotically very efficient but practically never so due to infeasibly large constants

Available in 7 languages

Español
Français
中文
Русский
Português
Tiếng Việt

via Wikidata sitelinks · CC0

Connections

computer science

International Standard Book Number

Categories

Analysis of algorithms Asymptotic analysis

Sources

wikipedia.externallinksexternallink

algorithm

Entity

Massachusetts Institute of Technology

digital object identifier

International Standard Serial Number

Fourier transform

maxima and minima

Dijkstra's algorithm

Advanced Encryption Standard

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Berlekamp–Welch algorithm

Entitydist 0.56

Risch algorithm

Entitydist 0.59

Kaprekar's constant

Entitydist 0.61

Tomasulo algorithm

Entitydist 0.61

approximate string-matching algorithm

Entitydist 0.61

Svetlana Selezneva

Entitydist 0.63

Rabin–Karp algorithm

Entitydist 0.63

Schönberg–Chandrasekhar limit

Entitydist 0.63

Favard constant

Entitydist 0.64

Pohlig–Hellman algorithm

Entitydist 0.64

Schönhage–Strassen algorithm

Entitydist 0.64

Gauss's Easter algorithm

Entitydist 0.64

What links here10 pages

approximation algorithm

multiplication algorithm

Computational complexity of mathematical operations

matrix multiplication algorithm

Schönhage–Strassen algorithm

AKS primality test

Strassen algorithm