User contributions for Admin

15 February 2023

• 11:1711:17, 15 February 2023 diff hist +308‎ N Tarjan Splay Tree ( Self-Balancing Trees Creation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (Need to keep track of intermediary stages of tree before outputting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1985 == Reference =="
• 11:1711:17, 15 February 2023 diff hist +308‎ N Hopcroft 2-3 Tree ( Self-Balancing Trees Creation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (Need to keep track of intermediary stages of tree before outputting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference =="
• 11:1711:17, 15 February 2023 diff hist +355‎ N Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Creation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (Need to keep track of intermediary stages of tree before outputting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://ieeexplore.ieee.org/document/4567957"
• 11:1711:17, 15 February 2023 diff hist +308‎ N AVL Tree ( Self-Balancing Trees Creation) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (Need to keep track of intermediary stages of tree before outputting) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1962 == Reference =="
• 11:1711:17, 15 February 2023 diff hist +481‎ N Pollard's kangaroo algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({1})$ words (Stores a constant number of O(n)-bit values (a, b, x_i, d, x_N, y_i, d_i) per iteration; assumes that the pseudorandom map is part of the input) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1978 == Reference == https://www.ams.org/mcom/1978-32-143/S0025-5718-1978-0491431-9/S0025-5718-1978-0491431..." current
• 11:1711:17, 15 February 2023 diff hist +403‎ N Pollard's rho algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^{(n/{2})})$ == Space Complexity == $O({1})$ words (Stores a constant number of O(n)-bit values per iteration) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1978 == Reference == https://www.ams.org/mcom/1978-32-143/S0025-5718-1978-0491431-9/S0025-5718-1978-0491431-9.pdf" current
• 11:1711:17, 15 February 2023 diff hist +551‎ N Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^{\sqrt{n}})$, only for primes; does much better for composites == Space Complexity == $O({2}^{\sqrt{n}})$ (though only for primes) words (A step in the algorithm involves using baby-steps giant-steps to compute discrete logs; the rest of the algorithm (including CRT and repeated powers) isn't as intensive) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM ==..." current
• 11:1711:17, 15 February 2023 diff hist +335‎ N Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n^{2/3})$ bits (http://www.ams.org/notices/199612/pomerance.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference == http://www.ams.org/notices/199612/pomerance.pdf" current
• 11:1711:17, 15 February 2023 diff hist +414‎ N Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations) ‎ Created page with "== Time Complexity == $O(e^{(\sqrt({2}) \sqrt(n*logn))})$ == Space Complexity == $O(n+r^{2})$? bits (See Dixon's algorithm for factoring integers; also works with an O(r)-by-O(r) sized matrix (to obtain discrete logs of primes in factor base)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == RAM? == Year == 1922 == Reference == NA" current
• 11:1711:17, 15 February 2023 diff hist +351‎ N Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n^{2/3})$? bits (Derived: same space as Number Field Sieve?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://www.sciencedirect.com/science/article/pii/S0890540198927614"
• 11:1711:17, 15 February 2023 diff hist +338‎ N Baby-step Giant-step (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^{\sqrt{n}})$ == Space Complexity == $O({2}^{\sqrt{n}})$ words (Derived: Uses a hash table of this size) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1971 == Reference == https://doi.org/10.1090/pspum/020" current
• 11:1711:17, 15 February 2023 diff hist +430‎ N Trial Multiplication (Discrete Logarithm Over Finite Fields Logarithm Calculations) ‎ Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({1})$ words (Derived: Each power $k$ that you try in the brute force search is size $O(\log n)$, which is $O(1)$ when considering $O(\log n)$ size words. Only need to keep track of one at a time.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == NA" current
• 11:1711:17, 15 February 2023 diff hist +504‎ N Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(|V | + m|E|)$ == Space Complexity == $O(mV)$ words (Derived: algorithm uses a V-sized array of bitvectors each of which is of length m, and also uses a priority queue which has at most V elements. The precomputed pattern bitvectors also takes up O(V * m) space.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2019 == Reference == https://www.ncb..."
• 11:1711:17, 15 February 2023 diff hist +364‎ N Jain, Chang (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(|V | + m|E|)$ == Space Complexity == $O(V)$ words (https://www.biorxiv.org/content/10.1101/522912v1.full.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2019 == Reference == https://www.biorxiv.org/content/10.1101/522912v1.full.pdf"
• 11:1711:17, 15 February 2023 diff hist +318‎ N Rautiainen and Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(|V | + m|E|)$ == Space Complexity == $O(\sqrt(m)|V|)$ words (same paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2017 == Reference == https://www.biorxiv.org/content/10.1101/216127v1"
• 11:1711:17, 15 February 2023 diff hist +373‎ N V-ALIGN (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(m|V |E|)$ == Space Complexity == $O(mV)$ words (https://www.biorxiv.org/content/10.1101/124941v1.full) == Description == Dynamic Programming == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2018 == Reference == https://www.biorxiv.org/content/10.1101/124941v1.full"
• 11:1711:17, 15 February 2023 diff hist +313‎ N HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(m(|V | log(m|V |)$ + |E|)) == Space Complexity == $O(m*(V+E)$) words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/26589280"
• 11:1711:17, 15 February 2023 diff hist +330‎ N Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(n(|V | + |E|)$) == Space Complexity == $O(V)$ words (same paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.sciencedirect.com/science/article/pii/S0304397599003333"
• 11:1711:17, 15 February 2023 diff hist +482‎ N Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎ Created page with "== Time Complexity == $O(m(|n | log |m | + |E|)$) == Space Complexity == $O(mn)$ words (https://reader.elsevier.com/reader/sd/pii/S0304397599003333?token=C0E6BDF7BA98CD5C338EDB86675CB3A29AF44F5B046E169EE0F115788255757C815F0F0307EAF080CDF9A9DE7AA37764) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1997 == Reference == https://link.springer.com/chapter/10.1007/3-540-633..."
• 11:1711:17, 15 February 2023 diff hist +431‎ N PSLQ algorithm (Integer Relation Integer Relation) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (Derived: Uses multiple nxn auxiliary matrices) == Description == Partial Sum of Squares using QR decomposition == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1992 == Reference == https://www.ams.org/journals/mcom/1999-68-225/S0025-5718-99-00995-3/S0025-5718-99-00995-3.pdf" current
• 11:1711:17, 15 February 2023 diff hist +416‎ N PSOS algorithm (Integer Relation Integer Relation) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (Derived: Uses multiple nxn auxiliary matrices) == Description == Partial Sum of Squares == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1988 == Reference == https://www.ams.org/journals/mcom/1989-53-188/S0025-5718-1989-0979934-9/S0025-5718-1989-0979934-9.pdf" current
• 11:1711:17, 15 February 2023 diff hist +399‎ N LLL algorithm (Integer Relation Integer Relation) ‎ Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == $O(n^{2})$ words (Derived: Uses n auxiliary vectors each of length n, as well as an nxn matrix) == Description == Lattice-based == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://www.math.leidenuniv.nl/~hwl/PUBLICATIONS/1982f/art.pdf" current
• 11:1711:17, 15 February 2023 diff hist +388‎ N Ferguson–Forcade algorithm (Integer Relation Integer Relation) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (Derived: Uses auxiliary $n\times n$ matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1979 == Reference == https://www.ams.org/journals/bull/1979-01-06/S0273-0979-1979-14691-3/S0273-0979-1979-14691-3.pdf" current
• 11:1711:17, 15 February 2023 diff hist +407‎ N Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) ‎ Created page with "== Time Complexity == $O(n^{4}L(log(n)$ + L)log(log(n) + L)) == Space Complexity == $O(n^{2}(n*log(n)$+nL)) bits (Keeps track of $O(n^2)$ entries that have absolute value at most $O(n^{(n/2)}2^{(nL)})$) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? (without O(1) multiplication) == Year == 1968 == Reference == -"
• 11:1711:17, 15 February 2023 diff hist +505‎ N Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) ‎ Created page with "== Time Complexity == $O(n^{5}L^{2} (log(n)$^{2} + L^{2})) == Space Complexity == $O(n^{2}(n*log(n)$+nL)) bits (Keeps track of $O(n^2)$ entries that have absolute value at most $O(n^{(n/2)}2^{(nL)})$) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? (without O(1) multiplication) == Year == 1968 == Reference == https://www.ams.org/journals/mcom/1968-22-103/S0025-5718-1968-0226829-0..."
• 11:1611:16, 15 February 2023 diff hist +452‎ N Ruchansky (Minimum Wiener Connector problem Wiener Index) ‎ Created page with "== Time Complexity == $O(q(m*log(n)$+n*log^{2}(n))) == Space Complexity == $O(q(m+n*log(n)$)? words (Keeps track of $O(qm)$ shortest-path distances and $O(q*log(n))$ approximate Steiner trees, each of size $O(n)$) == Description == == Approximate? == Approximate Approximation Factor: O(1) == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference == https://arxiv.org/abs/1504.00513" current
• 11:1611:16, 15 February 2023 diff hist +297‎ N Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut) ‎ Created page with "== Time Complexity == $O(VE)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2018 == Reference == https://pubsonline.informs.org/doi/epdf/10.1287/ijoc.2017.0798"
• 11:1611:16, 15 February 2023 diff hist 0‎ Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎No edit summary Tags: Manual revert Reverted
• 11:1611:16, 15 February 2023 diff hist 0‎ Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎No edit summary Tags: Manual revert Reverted
• 11:1611:16, 15 February 2023 diff hist +301‎ N LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) ‎ Created page with "== Time Complexity == $O(n log^{3}n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0097849302001231"
• 11:1611:16, 15 February 2023 diff hist +274‎ N PINKALL U.; POLTHIER K 1993 (Mesh Parameterization Mesh Parameterization) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference == http://www.cs.jhu.edu/~misha/Fall09/Pinkall93.pdf" current
• 11:1611:16, 15 February 2023 diff hist +274‎ N FLOATER 1997 (Mesh Parameterization Mesh Parameterization) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == http://www.cs.jhu.edu/~misha/Fall09/Floater97.pdf" current
• 11:1611:16, 15 February 2023 diff hist +269‎ N ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference == https://dl.acm.org/doi/10.1145/218380.218440" current
• 11:1611:16, 15 February 2023 diff hist +222‎ N B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎ Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==" current
• 11:1611:16, 15 February 2023 diff hist +409‎ N P. Costantini; B. I. Kvasov; and C. Manni 1999 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎ Created page with "== Time Complexity == $O(n^{5} logK)$ == Space Complexity == $O(n)$? words (Derived: Pentadiagonal matrix in the linear system only requires O(n) space) == Description == Pentadiagonal linear system == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://link.springer.com/article/10.1023/A:1018988312596" current
• 11:1611:16, 15 February 2023 diff hist +227‎ N V. I. Paasonen 1968 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎ Created page with "== Time Complexity == $O(n^{5} logK)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1968 == Reference ==" current
• 11:1611:16, 15 February 2023 diff hist +316‎ N V. A. Lyul’ka and I. E. Mikhailov 2003 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎ Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=zvmmf&paperid=943&option_lang=eng" current
• 11:1611:16, 15 February 2023 diff hist +261‎ N V. A. Lyul’ka and A. V. Romanenko 1994 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎ Created page with "== Time Complexity == $O(n^{5})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference == https://www.mathnet.ru/eng/zvmmf2544" current
• 11:1611:16, 15 February 2023 diff hist +293‎ N Kvasov 2006 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎ Created page with "== Time Complexity == $O(n^{3} log^{2}K)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference == https://link.springer.com/article/10.1134/S0965542508040039" current
• 11:1611:16, 15 February 2023 diff hist +384‎ N Adaptive Duplicate Detection Algorithm (ADD) (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O({1})$ words (Derived: For SVM, only need to store a constant number of support vectors) == Description == SVM string similarity == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://dl.acm.org/doi/10.1145/956750.956759" current
• 11:1611:16, 15 February 2023 diff hist +362‎ N Sorted Neighborhood Algorithm (SNA) (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Derived: store a key for each entry in the "Create Key" phase) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://link.springer.com/article/10.1023/A:1009761603038" current
• 11:1611:16, 15 February 2023 diff hist +222‎ N Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference =="
• 11:1611:16, 15 February 2023 diff hist +331‎ N Priority Queue Algorithm (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Derived: Auxiliary space needed for the priority queue) == Description == Selection sort using priority queue? == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference ==" current
• 11:1611:16, 15 February 2023 diff hist +299‎ N BST Algorithm (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(\log n)$ words (Derived: Space required for the recursion stack space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference =="
• 11:1611:16, 15 February 2023 diff hist +222‎ N Sorting based (Merge Sort) + real-time elimination (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1964 == Reference =="
• 11:1611:16, 15 February 2023 diff hist +276‎ N Sorting based (Merge Sort) (Duplicate Elimination Duplicate Elimination) ‎ Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (Derived: linear space for mergesort) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1964 == Reference =="
• 11:1611:16, 15 February 2023 diff hist +272‎ N Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) ‎ Created page with "== Time Complexity == $O(\exp(n)$) == Space Complexity == ? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2011 == Reference == https://arxiv.org/abs/1203.3636" current
• 11:1611:16, 15 February 2023 diff hist +841‎ N Fulkerson–Chen–Anstee (Digraph Realization Problem Graph Realization Problems) ‎ Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Derived: Checking an inequality that involves 3 summations, of max value $O(n^2)$ each (assuming max degree $\leq n$) which is $O(1)$ words in our Word RAM. We check this inequality for each $k = 1, \ldots, n$, but you can store the summations dynamically, so you only need to run $O(1)$ operations per iteration) == Description == Makes use of (0,1) matrix properties, checks a property of the inp..." current
• 11:1611:16, 15 February 2023 diff hist +425‎ N Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems) ‎ Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ words (Derived: Space complexity bounded by time complexity; keep track of a constant number of sets of size $O(n)$) == Description == Constructs graph == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1973 == Reference == https://linkinghub.elsevier.com/retrieve/pii/0012365X7390037X" current
• 11:1611:16, 15 February 2023 diff hist +317‎ N Bodlaender (Partial k-trees Graph Isomorphism Problem) ‎ Created page with "== Time Complexity == $O(n^{(k+{4.5})})$ == Space Complexity == check words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1990 == Reference == https://www.sciencedirect.com/science/article/pii/0196677490900135" current