All public logs

Jump to navigation Jump to search

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).

Logs
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
  • 10:58, 10 October 2022 Admin talk contribs created page Line Clipping (Created page with "== Problem Description== Given a set of lines and a rectangular area of interest, the task is to remove lines which are outside the area of interest and clip the lines which are partially inside the area. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algor...")
  • 10:58, 10 October 2022 Admin talk contribs created page Linde–Buzo–Gray Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:58, 10 October 2022 Admin talk contribs created page Lemke–Howson algorithm (Created page with "== Algorithm Details == Year : 1964 Family : Nash Equilibria Authors : C. E. Lemke and J. T. Howson, Jr. Read More: https://epubs.siam.org/doi/abs/10.1137/0112033?journalCode=smjmap.1& Paper Link : https://epubs.siam.org/doi/abs/10.1137/0112033?journalCode=smjmap.1 Time Complexity : == Problem Statement == Nash equilibrium is a concept within game theory where the optimal outcome of a game is where there is no incentive to deviate from the initial strategy. Mo...")
  • 10:58, 10 October 2022 Admin talk contribs created page Lemke–Howson Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:58, 10 October 2022 Admin talk contribs created page Lawler's Graph Coloring Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page LU decomposition (Created page with "== Problem Description== LU decomposition of a matrix is the factorization of a given square matrix into two triangular matrices, one upper triangular matrix and one lower triangular matrix, such that the product of these two matrices gives the original matrix. It was introduced by Alan Turing in 1948, who also created the Turing machine. This method of factorizing a matrix as a product of two triangular matrices has various applications such as a solution of a system o...")
  • 10:57, 10 October 2022 Admin talk contribs created page Kth order statistic (Created page with "== Problem Description== the kth order statistic of a statistical sample is equal to its kth-smallest value. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/F...")
  • 10:57, 10 October 2022 Admin talk contribs created page Kruskal's Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Knuth-Morris-Pratt Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Knuth's DP Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Khachiyan Ellipsoid Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Key exchange (Created page with "== Problem Description== Key exchange (also key establishment) is a method in cryptography by which cryptographic keys are exchanged between two parties, allowing use of a cryptographic algorithm. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper...")
  • 10:57, 10 October 2022 Admin talk contribs created page Karatsuba Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Kahn's Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page K-d Tree (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Joins (Created page with "== Problem Description== An SQL join clause - corresponding to a join operation in relational algebra - combines columns from one or more tables in a relational database. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Pape...")
  • 10:57, 10 October 2022 Admin talk contribs created page Jarvis Scan (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Integer relation (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic | | |- | rowspa...")
  • 10:57, 10 October 2022 Admin talk contribs created page Informed Search (Created page with "== Problem Description== Informed search tries to reduce the amount of search that must be done by making intelligent choices for the nodes that are selected for expansion. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40...")
  • 10:57, 10 October 2022 Admin talk contribs created page Improvement Rankings (Created page with "This analysis shows the progress over time for four different algorithm families, each shown in one color. In each case, performance is normalized to $1$ for the first algorithm in that family. Whenever an algorithm is discovered with better asymptotic complexity, it is represented by a vertical step up. For example, Grenander's algorithm for the maximum subarray problem, which is used in genetics (and elsewhere), is an improvement of 1 million times over the brute forc...")
  • 10:57, 10 October 2022 Admin talk contribs created page Image Processing (Created page with "Digital image processing is the use of a digital computer to process digital images through an algorithm. As a subcategory or field of digital signal processing, digital image processing has many advantages over analog image processing. It allows a much wider range of algorithms to be applied to the input data and can avoid problems such as the build-up of noise and distortion during processing. Since images are defined over two dimensions (perhaps more) digital image pr...")
  • 10:57, 10 October 2022 Admin talk contribs created page INDEGREE analysis (Created page with "== Problem Description== Link analysis is a data analysis technique used in network theory that is used to evaluate the relationships or connections between network nodes. These relationships can be between various types of objects (nodes), including people, organizations and even transactions. Link analysis is essentially a kind of knowledge discovery that can be used to visualize data to allow for better analysis, especially in the context of links, whether Web links...")
  • 10:57, 10 October 2022 Admin talk contribs created page Hungarian Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Huffman Encoding (Created page with "== Problem Description== an optimal binary search tree (Optimal BST); sometimes called a weight-balanced binary tree; is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or access probabilities). Optimal BSTs are generally divided into two types: static and dynamic. == Bounds Chart == 350px == Step Chart == File:H...")
  • 10:57, 10 October 2022 Admin talk contribs created page Hopcroft–Karp algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Hopcroft's DFA Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:57, 10 October 2022 Admin talk contribs created page Hoare's Selection Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Historical Origins (Created page with "Panel (a) shows the timing for when the first algorithm in each family appeared, often as a brute-force implementation (straightforward, but computationally inefficient) and (b) shows the share of algorithms in each decade where asymptotic time complexity improved. For example, in the 1970s, 23 new algorithm families were discovered and 34% of all the previously-discovered algorithm families were improved upon. In later decades, these rates of discovery and improvement...")
  • 10:56, 10 October 2022 Admin talk contribs created page Hierholzer's Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Held–Karp Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Hash Functions (Redirected page to Databases) Tag: New redirect
  • 10:56, 10 October 2022 Admin talk contribs created page Gröbner bases (Created page with "== Problem Description== In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x1, ..,xn] over a field K. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;...")
  • 10:56, 10 October 2022 Admin talk contribs created page Greatest Common Divisor (Created page with "== Problem Description== The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common to a and b. For example, GCD(3,5)=1, GCD(12,60)=12, and GCD(12,90)=6. The greatest common divisor GCD(a,b,c,...) can also be defined for three or more positive integers as the largest divisor shared by all of them. Two or more positive integers that have greatest common divis...")
  • 10:56, 10 October 2022 Admin talk contribs created page Graph edit distance computation (Created page with "== Problem Description== In mathematics and computer science, graph edit distance (GED) is a measure of similarity (or dissimilarity) between two graphs. The concept of graph edit distance was first formalized mathematically by Alberto Sanfeliu and King-Sun Fu in 1983. A major application of graph edit distance is in inexact graph matching, such as error-tolerant pattern recognition in machine learning == Bounds Chart == File:Graph_edit_distance_computationBoundsChart...")
  • 10:56, 10 October 2022 Admin talk contribs created page Godbole's DP Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Generating random permutations (Created page with "== Problem Description== Generating random permutation of an input string. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | |...")
  • 10:56, 10 October 2022 Admin talk contribs created page Gaussian Elimination (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Fortune-Hopcroft Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Ford Fulkerson Algorithm (Created page with "== Algorithm Details == Year : 1956 Family : Maximum Flow Authors : Edsger W. Dijkstra Paper Link : http://www-m3.ma.tum.de/foswiki/pub/MN0506/WebHome/dijkstra.pdf Time Complexity : == Problem Statement == In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circula...")
  • 10:56, 10 October 2022 Admin talk contribs created page Floyd-Warshall Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Floyd's Cycle-Finding Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Fisher–Yates Shuffle (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page First category integer factoring (Created page with "== Problem Description== An important subclass of special-purpose factoring algorithms is the Category 1 or First Category algorithms, whose running time depends on the size of smallest prime factor. Given an integer of unknown form, these methods are usually applied before general-purpose methods to remove small factors. For example, naive trial division is a Category 1 algorithm. == Bounds Chart == 1050px == St...")
  • 10:56, 10 October 2022 Admin talk contribs created page Faugère F4 Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:56, 10 October 2022 Admin talk contribs created page Factorization of polynomials over finite fields (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1"...")
  • 10:56, 10 October 2022 Admin talk contribs created page Enumerating Maximal Cliques (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" |...")
  • 10:56, 10 October 2022 Admin talk contribs created page Entity resolution (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic | | |- | rows...")
  • 10:56, 10 October 2022 Admin talk contribs created page Elliptic-curve Diffie-Hellman (ECDH) (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:55, 10 October 2022 Admin talk contribs created page Edmonds-Karp Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:55, 10 October 2022 Admin talk contribs created page Duplicate Elimination (Created page with "== Problem Description== SQL does not eliminate duplicates implicitly. It allows to enter duplicate values on columns other than candidate key or if did not specified any keys. If the user wants to eliminate duplicate records, he has to use DISTINCT keyword in the query. Databases, therefore, can have duplicate entries. The problem deals with identifying and removing duplicates from a database. == Bounds Chart == 1050px ==...")
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:Log"