New pages

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 10:32, 15 February 2023 ‎François Le Gall (Matrix Multiplication Matrix Product) (hist | edit) ‎[326 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.{372863}9})$ == Space Complexity == $O(n^{2})$ words (Re-use of space in recursive branches) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2014 == Reference == https://arxiv.org/abs/1401.7714")
• 10:32, 15 February 2023 ‎Vassilevska Williams (Matrix Multiplication Matrix Product) (hist | edit) ‎[344 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.{37287}3})$ == Space Complexity == $O(n^{2})$ words (Re-use of space in recursive branches) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2014 == Reference == http://theory.stanford.edu/~virgi/matrixmult-f.pdf")
• 10:32, 15 February 2023 ‎Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product) (hist | edit) ‎[351 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.{49554}8})$ == Space Complexity == $O(n^{2})$ words (Re-use of space in recursive branches) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://epubs.siam.org/doi/abs/10.1137/0211038")
• 10:32, 15 February 2023 ‎Romani's algorithm (Matrix Multiplication Matrix Product) (hist | edit) ‎[339 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.{5166}5})$ == Space Complexity == $O(n^{2})$ words (Re-use of space in recursive branches) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://epubs.siam.org/doi/abs/10.1137/0211020")
• 10:32, 15 February 2023 ‎Pan's algorithm (Matrix Multiplication Matrix Product) (hist | edit) ‎[370 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{(log({143640})/log({70}))}) ~ O(n^{2.{79}5})$ == Space Complexity == $O(n^{2})$ words (Re-use of space in recursive branches) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1978 == Reference == https://ieeexplore.ieee.org/document/4567976")
• 10:32, 15 February 2023 ‎Strassen's algorithm (Matrix Multiplication Matrix Product) (hist | edit) ‎[369 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{(log7/log2)}) ~ O(n^{2.{80}7})$ == Space Complexity == $O(n^{2})$ words (http://www.cs.cmu.edu/afs/cs/academic/class/15750-s17/ScribeNotes/lecture1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1969 == Reference == https://link.springer.com/article/10.1007%2FBF02165411")
• 10:32, 15 February 2023 ‎Naive algorithm (Matrix Multiplication Matrix Product) (hist | edit) ‎[278 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O({1})$ auxiliary words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")
• 10:32, 15 February 2023 ‎Galil & Naamad ( Maximum Flow) (hist | edit) ‎[340 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(VELog^{2}V)$ == Space Complexity == $O(E)$ words (https://core.ac.uk/download/pdf/81946904.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://core.ac.uk/download/pdf/81946904.pdf")
• 10:32, 15 February 2023 ‎Karzanov ( Maximum Flow) (hist | edit) ‎[351 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3})$ == Space Complexity == $O(V^{2})$ words (https://core.ac.uk/download/pdf/81946904.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == http://alexander-karzanov.net/Publications/maxflow-acyc.pdf")
• 10:32, 15 February 2023 ‎Edmonds & Karp ( Maximum Flow) (hist | edit) ‎[368 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(E^{2}LogU)$ == Space Complexity == $O(E)$ words (https://core.ac.uk/download/pdf/81946904.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://web.eecs.umich.edu/~pettie/matching/Edmonds-Karp-network-flow.pdf")
• 10:32, 15 February 2023 ‎Dinitz ( Maximum Flow) (hist | edit) ‎[392 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2}E)$ == Space Complexity == $O(E)$ words (https://core.ac.uk/download/pdf/81946904.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://www.scirp.org/(S(lz5mqp453edsnp55rrgjct55))/reference/ReferencesPapers.aspx?ReferenceID=1690549")
• 10:32, 15 February 2023 ‎Ford & Fulkerson ( Maximum Flow) (hist | edit) ‎[362 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(E^{2}U)$ == Space Complexity == $O(E)$ words (https://core.ac.uk/download/pdf/81946904.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1955 == Reference == http://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.pdf")
• 10:32, 15 February 2023 ‎Wagner and Fischer (LCS Longest Common Subsequence) (hist | edit) ‎[336 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(mn)$, later $O(m+n)$ due to Hirschberg words (https://dl.acm.org/doi/10.1145/360825.360861) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://dl.acm.org/citation.cfm?doid=321796.321811")
• 10:32, 15 February 2023 ‎Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication) (hist | edit) ‎[319 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (CLRS) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference == -")
• 10:31, 15 February 2023 ‎Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication) (hist | edit) ‎[259 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == O ({4}^n) == Space Complexity == $O(n)$ words (can be derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")
• 10:31, 15 February 2023 ‎Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic) (hist | edit) ‎[327 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (in-situ) words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1961 == Reference == https://dl.acm.org/citation.cfm?doid=366622.366647")
• 10:31, 15 February 2023 ‎Naive Selection (kth Order Statistic kth Order Statistic) (hist | edit) ‎[281 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O({1})$ (can use in-situ sorting) words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")
• 10:31, 15 February 2023 ‎Radix Sort (Non-Comparison Sorting Sorting) (hist | edit) ‎[261 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(wn)$ == Space Complexity == $O(w+n)$ words ((wikipedia page?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")
• 10:31, 15 February 2023 ‎Bucket Sort (Non-Comparison Sorting Sorting) (hist | edit) ‎[249 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O( n² )$ == Space Complexity == $O(n)$ words (CLRS) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")
• 10:31, 15 February 2023 ‎Counting Sort (Non-Comparison Sorting Sorting) (hist | edit) ‎[424 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n+k)$ == Space Complexity == $O(n+k)$ words ((can be easily derived)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1954 == Reference == http://bitsavers.org/pdf/mit/whirlwind/R-series/R-232_Information_Sorting_in_the_Application_of_Electronic_Digital_Computers_to_Business_Operations_May54.pdf")
• 10:31, 15 February 2023 ‎Heap Sort (Comparison Sorting Sorting) (hist | edit) ‎[355 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O({1})$ (in-situ) words ((can be easily derived)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1964 == Reference == https://www.bibsonomy.org/bibtex/2f485e4ea9a877871b59ab503151a7f10/bjoern")
• 10:31, 15 February 2023 ‎Intro Sort (Comparison Sorting Sorting) (hist | edit) ‎[400 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(logn)$ words ((see quicksort + heapsort)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1997 == Reference == https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-024X%28199708%2927%3A8%3C983%3A%3AAID-SPE117%3E3.0.CO%3B2-%23")
• 10:31, 15 February 2023 ‎Bubble Sort (Comparison Sorting Sorting) (hist | edit) ‎[264 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O( n² )$ == Space Complexity == $O({1})$ (in-situ) words (in-situ) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1956 == Reference == -")
• 10:31, 15 February 2023 ‎Merge Sort (Comparison Sorting Sorting) (hist | edit) ‎[310 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words (need some way to store partially processed lists while merging) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1945 == Reference == -")
• 10:31, 15 February 2023 ‎Selection Sort (Comparison Sorting Sorting) (hist | edit) ‎[264 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O( n² )$ == Space Complexity == $O({1})$ (in-situ) words (in-situ) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1962 == Reference == -")
• 10:31, 15 February 2023 ‎Naive sorting (Comparison Sorting Sorting) (hist | edit) ‎[264 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O( n² )$ == Space Complexity == $O({1})$ (in-situ) words (in-situ) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")
• 10:31, 15 February 2023 ‎Nivasch ( Cycle Detection) (hist | edit) ‎[385 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(\mu + \lambda)$ == Space Complexity == $O(logn)$ Stack size (https://www.gabrielnivasch.org/fun/cycle-detection) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == not mentioned == Year == 2004 == Reference == https://drive.google.com/file/d/16H_lrjeaBJqWvcn07C_w-6VNHldJ-ZZl/view")
• 10:31, 15 February 2023 ‎Sedgewick; Szymanski; and Yao ( Cycle Detection) (hist | edit) ‎[400 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $(\mu + \lambda)({1}+\Theta({1}/sqrt(M)))$ == Space Complexity == M Memory cells (https://epubs.siam.org/doi/abs/10.1137/0211030?journalCode=smjcat) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1982 == Reference == https://epubs.siam.org/doi/abs/10.1137/0211030?journalCode=smjcat")
• 10:31, 15 February 2023 ‎Grigoryan (n-Queens Completion n-Queens Problem) (hist | edit) ‎[374 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (Derived: two control arrays of size O(n)) == Description == == Approximate? == Approximate Approximation Factor: error < 0.0001 and decreases with increasing n == Randomized? == Yes, Monte Carlo == Model of Computation == == Year == 2018 == Reference == https://arxiv.org/abs/1912.05935")
• 10:31, 15 February 2023 ‎Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis) (hist | edit) ‎[321 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(N)$ == Space Complexity == $O(N)$ (https://arxiv.org/abs/1705.06566) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2017 == Reference == https://arxiv.org/abs/1705.06566")
• 10:31, 15 February 2023 ‎Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis) (hist | edit) ‎[373 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log n)$ == Space Complexity == $O(nd)$ (https://dl.acm.org/doi/abs/10.1145/344779.345009) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == TSVQ Tree == Year == 2000 == Reference == https://dl.acm.org/doi/abs/10.1145/344779.345009")
• 10:31, 15 February 2023 ‎MotifSampler (Motif Search Motif Search) (hist | edit) ‎[368 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(n + m)$ words (derived: essentially just modified Gibbs sampling) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2001 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/12015892")
• 10:31, 15 February 2023 ‎Lawrence Gibbs Sampling (Motif Search Motif Search) (hist | edit) ‎[387 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(n + m)$ words (derived: two data structures, one uses O(n) and one uses O(m)) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1993 == Reference == https://science.sciencemag.org/content/262/5131/208")
• 10:31, 15 February 2023 ‎Lawrence, Reilly (Motif Search Motif Search) (hist | edit) ‎[358 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(nm)$ words (https://www.ncbi.nlm.nih.gov/pubmed/2184437) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1990 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/2184437")
• 10:31, 15 February 2023 ‎Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) (hist | edit) ‎[358 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O({1})$ == Space Complexity == $O({1})$ words (derived: must be \leq time complexity) == Description == == Approximate? == Approximate Approximation Factor: 2 + \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008 == Reference == https://arxiv.org/pdf/0812.4893.pdf")
• 10:31, 15 February 2023 ‎Lokshtanov (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[346 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(n^{3} t)$ == Space Complexity == $O(n^{2})$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2010 == Reference == https://dl.acm.org/doi/abs/10.1145/1806689.1806735")
• 10:31, 15 February 2023 ‎Serang (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[350 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(n max(S))$ == Space Complexity == $O(t logt)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2014 == Reference == https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0091507")
• 10:31, 15 February 2023 ‎Epstein (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[380 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $\tilde{O}(n max(S))$ == Space Complexity == $O(t logt)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S019667749690841X?via%3Dihub")
• 10:31, 15 February 2023 ‎Klinz (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[371 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(σ^{({3}/{2})})$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://doi.org/10.1002/(SICI)1097-0037(199905)33:3%3C189::AID-NET5%3E3.0.CO;2-2")
• 10:31, 15 February 2023 ‎Pferschy (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[336 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n' t)$ == Space Complexity == $O(t)$ (https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://link.springer.com/article/10.1007/s006070050042")
• 10:31, 15 February 2023 ‎Faaland (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[304 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n' t)$ == Space Complexity == $O(t)$ (https://doi.org/10.1287/opre.21.1.332) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference == https://doi.org/10.1287/opre.21.1.332")
• 10:31, 15 February 2023 ‎Pisinger (Subset Sum The Subset-Sum Problem) (hist | edit) ‎[369 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nt/logt)$ == Space Complexity == $O(t/logt)$ words (https://link.springer.com/article/10.1007/s00453-002-0989-y) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://link.springer.com/article/10.1007/s00453-002-0989-y")
• 10:31, 15 February 2023 ‎Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (hist | edit) ‎[305 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == Varies by codebook structure == Space Complexity == Varies by codebook structure (Table 2) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==")
• 10:31, 15 February 2023 ‎Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) (hist | edit) ‎[418 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k)$ == Space Complexity == $O({1})$ words (Derived: There are 5 local variables and no tables or lists aside from input/output) == Description == == Approximate? == Approximate Approximation Factor: ? == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == http://www.araa.asn.au/acra/acra2013/papers/pap148s1-file1.pdf")
• 10:31, 15 February 2023 ‎Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (hist | edit) ‎[474 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nLkt)$ (pre-processing) $O(L(kt+dnP_2^k))$ (query-time) == Space Complexity == $O(nL)$ hash table cells (https://en.wikipedia.org/wiki/Locality-sensitive_hashing#LSH_algorithm_for_nearest_neighbor_search) == Description == == Approximate? == Approximate Approximation Factor: c == Randomized? == No, deterministic == Model of Computation == == Year == 2010 == Reference == http://infolab.stanford.edu/~ullman/mmds/ch3n.pdf")
• 10:31, 15 February 2023 ‎Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (hist | edit) ‎[419 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(M)$ bytes of memory (https://arxiv.org/abs/1603.09320, "Memory usage is proportional to choice of M") == Description == == Approximate? == Approximate Approximation Factor: ? experimental results == Randomized? == No, deterministic == Model of Computation == == Year == 2018 == Reference == https://doi.org/10.1109/TPAMI.2018.2889473")
• 10:31, 15 February 2023 ‎Larmore (Approximate OBST Optimal Binary Search Trees) (hist | edit) ‎[402 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{1.6})$ == Space Complexity == $O(n)$ (Derived: Computing and storing f_{d,l} for each n elements) == Description == == Approximate? == Approximate Approximation Factor: \epsilon = o(1) == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference == https://www.sciencedirect.com/science/article/pii/0196677487900526")
• 10:31, 15 February 2023 ‎Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) (hist | edit) ‎[339 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (Derived: uses a worklist of size O(n)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference == https://epubs.siam.org/doi/abs/10.1137/S0895480193256651?journalCode=sjdmec")
• 10:31, 15 February 2023 ‎Karpinski (Approximate OBST Optimal Binary Search Trees) (hist | edit) ‎[433 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{0.6})$ == Space Complexity == $O({1})$ (Derived: dynamic programming and making use of Monge matrix properties) == Description == == Approximate? == Approximate Approximation Factor: \epsilon = o(1) == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.54.6940&rep=rep1&type=pdf")
• 10:31, 15 February 2023 ‎Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (hist | edit) ‎[458 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf, storing left/right subtrees' weights) == Description == == Approximate? == Approximate Approximation Factor: 0.63 H \leq P_opt \leq P_balanced \leq 2 + 1.44 H == Randomized? == No, deterministic == Model of Computation == == Year == 1975 == Reference == https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)