All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

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

10:31, 15 February 2023 Admin talk contribs created page Hoare's Selection Algorithm (QuickSelect) (kth Order Statistic kth Order Statistic) (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 Admin talk contribs created page Naive Selection (kth Order Statistic kth Order Statistic) (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 Admin talk contribs created page Radix Sort (Non-Comparison Sorting Sorting) (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 Admin talk contribs created page Bucket Sort (Non-Comparison Sorting Sorting) (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 Admin talk contribs created page Counting Sort (Non-Comparison Sorting Sorting) (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 Admin talk contribs created page Heap Sort (Comparison Sorting Sorting) (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 Admin talk contribs created page Intro Sort (Comparison Sorting Sorting) (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 Admin talk contribs created page Bubble Sort (Comparison Sorting Sorting) (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 Admin talk contribs created page Merge Sort (Comparison Sorting Sorting) (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 Admin talk contribs created page Selection Sort (Comparison Sorting Sorting) (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 Admin talk contribs created page Naive sorting (Comparison Sorting Sorting) (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 Admin talk contribs created page Nivasch ( Cycle Detection) (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 Admin talk contribs created page Sedgewick; Szymanski; and Yao ( Cycle Detection) (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 Admin talk contribs created page Grigoryan (n-Queens Completion n-Queens Problem) (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 Admin talk contribs created page Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis) (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 Admin talk contribs created page Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis) (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 Admin talk contribs created page MotifSampler (Motif Search Motif Search) (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 Admin talk contribs created page Lawrence Gibbs Sampling (Motif Search Motif Search) (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 Admin talk contribs created page Lawrence, Reilly (Motif Search Motif Search) (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 Admin talk contribs created page Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) (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 Admin talk contribs created page Lokshtanov (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Serang (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Epstein (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Klinz (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Pferschy (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Faaland (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Pisinger (Subset Sum The Subset-Sum Problem) (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 Admin talk contribs created page Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (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 Admin talk contribs created page Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) (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 Admin talk contribs created page Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (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 Admin talk contribs created page Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (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 Admin talk contribs created page Larmore (Approximate OBST Optimal Binary Search Trees) (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 Admin talk contribs created page Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) (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 Admin talk contribs created page Karpinski (Approximate OBST Optimal Binary Search Trees) (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 Admin talk contribs created page Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (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")
10:31, 15 February 2023 Admin talk contribs created page Weak Parametrized Inapproximability Hypothesis (WPIH) (Created page with "== Target Problem == Approximate 2-CSP == Description == There is some constant $\delta > 0$ such that given an instance $\varphi$ of 2-CSP on the Boolean hypercube graph $Q$ over alphabet of size $n$, it is W(1)-hard to distinguish == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == == Proven? == No == Year == == References/Citation == ? CCC '22")
10:31, 15 February 2023 Admin talk contribs created page Parametrized Inapproximability Hypothesis (PIH) (Created page with "== Target Problem == Approximate 2-CSP == Description == There is some constant $\delta > 0$ such that 2-CSP on $k$ vertices and alphabet size $n$ is W(1)-hard to approximate to a $(1-\delta)$ factor == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == == Proven? == No == Year == 2017 == References/Citation == https://epubs.siam.org/doi/abs/10.1137/1.9781611975994.134")
10:31, 15 February 2023 Admin talk contribs created page $\delta$-Triangle Conjecture (Created page with "== Target Problem == Triangle Detection == Description == Any Algorithm requires $m^{1+\delta-o(1)}$ time in expectation to detect whether an $m$ edge graph contains a triangle == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == == References/Citation ==")
10:30, 15 February 2023 Admin talk contribs created page Strong Triangle Conjecture (Created page with "== Target Problem == Triangle Detection == Description == Any Algorithm requires $\min(n^{w-o(1)}, m^{2w/(w+1)-o(1)})$ time in expectation to detect whether an $n$ node $m$ edge graph contains a triangle. Moreover, any combinatorial algorithm requires $m^{3/2-o(1)}$ == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == 2014 == Referenc...")
10:30, 15 February 2023 Admin talk contribs created page More Believable Exponential Time Hypothesis (MBETH) (Created page with "== Target Problem == k-SAT == Description == There exists a $k \geq 3$ and a $\delta > 0$ so that $k$-SAT on $n$ variables cannot be solved in $O(2^{\delta n})$ == Implies the following Hypothesis == ETH == Implied by the following Hypothesis == ETH, SETH == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No ==...")
10:30, 15 February 2023 Admin talk contribs created page Nondeterministic Strong Exponential Time Hypothesis (NSETH) (Created page with "== Target Problem == [[]] == Description == Refuting unsatisfiable $k$-CNF formulas on $n$ variables requires nondeterministic $2^{n-o(n)}$ time for unbounded $k$. == Implies the following Hypothesis == SETH == Implied by the following Hypothesis == == Computation Model == == Proven? == No (Variants have been disproved) == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.p...")
10:30, 15 February 2023 Admin talk contribs created page Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) (Created page with "== Target Problem == OMV == Description == Every (randomized) algorithm that can process a given $n \times n$ Boolean matrix $A$, and then in an online way can compute the products $Av_i$ for any $n$ vectors $v_1,\ldots,v_n$, must take total time $n^{3-o(1)}$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == == References/Citatio...")
10:30, 15 February 2023 Admin talk contribs created page Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (Created page with "== Target Problem == BMM == Description == Any combinatorial BMM algorithm requires $n^{3-o(1)}$ time. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.pdf Page 17")
10:30, 15 February 2023 Admin talk contribs created page Exact k-Clique Hypothesis (Created page with "== Target Problem == Exact $k$-Clique == Description == The Exact $k$-Clique problem on $n$ node graphs with edge weights in $\{-n^{100k},\ldots,n^{100k}\}$ requires (randomized) $n^{k-o(1)}$ time. == Implies the following Hypothesis == OVH == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people...")
10:30, 15 February 2023 Admin talk contribs created page Min-Weight k-Clique Hypothesis (Created page with "== Target Problem == Min-Weight $k$-Clique == Description == The Min-Weight $k$-Clique problem on $n$ node graphs with edge weights in $\{-n^{100k},\ldots, n^{100k}}$ requires (randomized) $n^{k-o(1)}$ time. == Implies the following Hypothesis == Exact k-Clique Hypothesis, OVH == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven...")
10:30, 15 February 2023 Admin talk contribs created page Hitting Set Hypothesis (HS Hypothesis) (Created page with "== Target Problem == HS == Description == No randomized algorithm can solve HS on $n$ vectors in $\{0,1\}^d$ in $n^{2-\epsilon}\poly(d)$ time for $\epsilon > 0$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 5")
10:30, 15 February 2023 Admin talk contribs created page All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (Created page with "== Target Problem == APSP == Description == No randomized algorithm can solve APSP in $O(n^{3-\epsilon})$ time for $\epsilon > 0$ on $n$ node graphs with edge weights in $\{-n^c,\ldots,n^c\}$ and no negative cycles for large enough $c$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csa...")
10:30, 15 February 2023 Admin talk contribs created page 3SUM Hypothesis (3-SUM Hypothesis) (Created page with "== Target Problem == 3-SUM == Description == 3-SUM on $n$ integers in $\{-n^4,\ldots,n^4\}$ cannot be solved in $O(n^{2-\epsilon})$ time for any $\epsilon > 0$ by a randomized algorithm. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 2")
10:30, 15 February 2023 Admin talk contribs created page K-Clique Hypothesis (Created page with "== Target Problem == [[$k$-Clique for all $k > 0$]] == Description == No randomized algorithm can detect a $k$-Clique in an $n$-node graph in $O(n^{\omega k / 3 - \epsilon})$ time for any $\epsilon > 0$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.pdf Hypothe...")
10:30, 15 February 2023 Admin talk contribs created page K-OV Hypothesis (Created page with "== Target Problem == k-OV == Description == No randomized algorithm can solve k-OV on instances of size $n$ in $n^{k-\epsilon}\poly(d)$ time for constant $\epsilon > 0$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 4")

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

All public logs

Navigation menu

Search