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 250 | older 250) (20 | 50 | 100 | 250 | 500)

12:13, 10 October 2022 Admin talk contribs uploaded File:Constructing suffix treesBoundsChart.png
12:13, 10 October 2022 Admin talk contribs created page File:Constructing Eulerian trails in a GraphStepChart.png
12:13, 10 October 2022 Admin talk contribs uploaded File:Constructing Eulerian trails in a GraphStepChart.png
12:13, 10 October 2022 Admin talk contribs created page File:Constructing Eulerian trails in a GraphBoundsChart.png
12:13, 10 October 2022 Admin talk contribs uploaded File:Constructing Eulerian trails in a GraphBoundsChart.png
12:13, 10 October 2022 Admin talk contribs created page File:Closest Pair ProblemStepChart.png
12:13, 10 October 2022 Admin talk contribs uploaded File:Closest Pair ProblemStepChart.png
12:13, 10 October 2022 Admin talk contribs created page File:Closest Pair ProblemBoundsChart.png
12:13, 10 October 2022 Admin talk contribs uploaded File:Closest Pair ProblemBoundsChart.png
12:13, 10 October 2022 Admin talk contribs created page File:Change-making problemStepChart.png
12:13, 10 October 2022 Admin talk contribs uploaded File:Change-making problemStepChart.png
12:13, 10 October 2022 Admin talk contribs created page File:Change-making problemBoundsChart.png
12:13, 10 October 2022 Admin talk contribs uploaded File:Change-making problemBoundsChart.png
12:12, 10 October 2022 Admin talk contribs created page File:BCNF DecompositionStepChart.png
12:12, 10 October 2022 Admin talk contribs uploaded File:BCNF DecompositionStepChart.png
12:12, 10 October 2022 Admin talk contribs created page File:BCNF DecompositionBoundsChart.png
12:12, 10 October 2022 Admin talk contribs uploaded File:BCNF DecompositionBoundsChart.png
12:09, 10 October 2022 Admin talk contribs created page File:B6.png
12:09, 10 October 2022 Admin talk contribs uploaded File:B6.png
12:09, 10 October 2022 Admin talk contribs created page File:B5.png
12:09, 10 October 2022 Admin talk contribs uploaded File:B5.png
12:09, 10 October 2022 Admin talk contribs created page File:B4.png
12:09, 10 October 2022 Admin talk contribs uploaded File:B4.png
12:09, 10 October 2022 Admin talk contribs created page File:B3.png
12:09, 10 October 2022 Admin talk contribs uploaded File:B3.png
12:09, 10 October 2022 Admin talk contribs created page File:B2.png
12:09, 10 October 2022 Admin talk contribs uploaded File:B2.png
12:09, 10 October 2022 Admin talk contribs created page File:B1.png
12:09, 10 October 2022 Admin talk contribs uploaded File:B1.png
12:09, 10 October 2022 Admin talk contribs created page File:All permutationsStepChart.png
12:09, 10 October 2022 Admin talk contribs uploaded File:All permutationsStepChart.png
12:09, 10 October 2022 Admin talk contribs created page File:All permutationsBoundsChart.png
12:09, 10 October 2022 Admin talk contribs uploaded File:All permutationsBoundsChart.png
12:09, 10 October 2022 Admin talk contribs created page File:All-pairs shortest paths (Undirected)StepChart.png
12:09, 10 October 2022 Admin talk contribs uploaded File:All-pairs shortest paths (Undirected)StepChart.png
12:08, 10 October 2022 Admin talk contribs created page File:All-pairs shortest paths (Undirected)BoundsChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:All-pairs shortest paths (Undirected)BoundsChart.png
12:08, 10 October 2022 Admin talk contribs created page File:A6.png
12:08, 10 October 2022 Admin talk contribs uploaded File:A6.png
12:08, 10 October 2022 Admin talk contribs created page File:A5.png
12:08, 10 October 2022 Admin talk contribs uploaded File:A5.png
12:08, 10 October 2022 Admin talk contribs created page File:A4.png
12:08, 10 October 2022 Admin talk contribs uploaded File:A4.png
12:08, 10 October 2022 Admin talk contribs created page File:A3.png
12:08, 10 October 2022 Admin talk contribs uploaded File:A3.png
12:08, 10 October 2022 Admin talk contribs created page File:A2.png
12:08, 10 October 2022 Admin talk contribs uploaded File:A2.png
12:08, 10 October 2022 Admin talk contribs created page File:A1.png
12:08, 10 October 2022 Admin talk contribs uploaded File:A1.png
12:08, 10 October 2022 Admin talk contribs created page File:4 - Graph ColoringStepChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:4 - Graph ColoringStepChart.png
12:08, 10 October 2022 Admin talk contribs created page File:4 - Graph ColoringBoundsChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:4 - Graph ColoringBoundsChart.png
12:08, 10 October 2022 Admin talk contribs created page File:4NF decompositionStepChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:4NF decompositionStepChart.png
12:08, 10 October 2022 Admin talk contribs created page File:4NF decompositionBoundsChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:4NF decompositionBoundsChart.png
12:08, 10 October 2022 Admin talk contribs created page File:3 - Graph ColoringStepChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:3 - Graph ColoringStepChart.png
12:08, 10 October 2022 Admin talk contribs created page File:3 - Graph ColoringBoundsChart.png
12:08, 10 October 2022 Admin talk contribs uploaded File:3 - Graph ColoringBoundsChart.png
12:02, 10 October 2022 Admin talk contribs created page Wheel Factorization (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...")
12:02, 10 October 2022 Admin talk contribs created page Weighted Activity selection problem (Created page with "== Problem Description== Let's consider that you have n activities with their start and finish times, the objective is to find solution set having maximum number of non-conflicting activities that can be executed in a single time frame, assuming that only one person or machine is available for execution. It might not be possible to complete all the activities, since their timings can collapse. Two activities, say i and j, are said to be non-conflicting if si >= fj or sj...")
12:02, 10 October 2022 Admin talk contribs created page Wagner-Fischer 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...")
12:02, 10 October 2022 Admin talk contribs created page Vornoi Diagrams (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 | | |- | rowspan=...")
12:02, 10 October 2022 Admin talk contribs created page Vatti Clipping 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...")
12:02, 10 October 2022 Admin talk contribs created page Vaidya'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...")
12:01, 10 October 2022 Admin talk contribs created page Two-pass 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...")
12:01, 10 October 2022 Admin talk contribs created page Turnpike problem (Created page with "== Problem Description== The turnpike problem, also known as the partial digest problem, is: Given a multiset of (:) positive numbers AX, does there exist a set X such that AX is exactiy the multiset of al1 positive pairwise difierences of the elements of X. The complexity of the problem is aot known. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikit...")
12:01, 10 October 2022 Admin talk contribs created page Translating abstract syntax trees (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 | | |- | rowspan="1" | Quadrati...")
12:01, 10 October 2022 Admin talk contribs created page Transitive Reduction problem (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"...")
12:01, 10 October 2022 Admin talk contribs created page Topological Sorting (Created page with "== Problem Description== Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering. Topological Sorting for a graph is not possible if the graph is not a DAG. Topological Sorting is mainly used for scheduling jobs from the given dependencies among jobs. In computer science, applications of this type arise in instruction scheduling, ordering of formula cell evaluati...")
12:01, 10 October 2022 Admin talk contribs created page Todd–Coxeter 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...")
12:01, 10 October 2022 Admin talk contribs created page Three-dimensional elliptic partial differential equations (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...")
12:01, 10 October 2022 Admin talk contribs created page The vertex-cover problem (Created page with "== Problem Description== Given a universe U of n elements, a collection of subsets of U say S = {S1, S2…,Sm} where every subset Si has an associated cost. Find a minimum cost subcollection of S that covers all elements of U. It was one of Karp’s NP-complete problems, shown to be so in 1972. Other applications: edge covering, vertex cover Interesting example: IBM finds computer viruses (wikipedia) Elements- 5000 known viruses Sets- 9000 substrings of 20 or more conse...")
12:01, 10 October 2022 Admin talk contribs created page The traveling-salesman problem (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 | [https://www.jstor.org/stable/2098806 Held–Karp al...")
12:01, 10 October 2022 Admin talk contribs created page The subset-sum problem (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 | |...")
12:01, 10 October 2022 Admin talk contribs created page The set-covering problem (Created page with "== Problem Description== Given a universe U of n elements, a collection of subsets of U say S = {S1, S2…,Sm} where every subset Si has an associated cost. Find a minimum cost subcollection of S that covers all elements of U. It was one of Karp’s NP-complete problems, shown to be so in 1972. Other applications: edge covering, vertex cover Interesting example: IBM finds computer viruses (wikipedia) Elements- 5000 known viruses Sets- 9000 substrings of 20 or more conse...")
12:01, 10 October 2022 Admin talk contribs created page The frequent words problem (Created page with "== Problem Description== The problem is to find the most frequent kmers in Text. == 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 | |...")
12:01, 10 October 2022 Admin talk contribs created page Template Page (Created page with "== Problem Description== <Problem Description with references> == Bounds Chart == [[File:<Family_Name>BoundsChart.png|350px]] == Step Chart == [[File:<Family_Name>StepChart.png|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 | | |- | rows...")
12:01, 10 October 2022 Admin talk contribs created page Tarjan's SSC 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...")
12:01, 10 October 2022 Admin talk contribs created page Tarjan's LCA 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...")
12:01, 10 October 2022 Admin talk contribs created page Strongly Connected Components (Created page with "== Problem Description== Connectivity in an undirected graph means that every vertex can reach every other vertex via any path. If the graph is not connected the graph can be broken down into Connected Components. Strong Connectivity applies only to directed graphs. A directed graph is strongly connected if there is a directed path from any vertex to every other vertex. This is same as connectivity in an undirected graph, the only difference being strong connectivity ap...")
12:01, 10 October 2022 Admin talk contribs created page String Search (Created page with "== Problem Description== try to find a place where one or several strings (also called patterns) are found within a larger string or text. == 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 |- | ro...")
12:01, 10 October 2022 Admin talk contribs created page Strassen'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...")
12:01, 10 October 2022 Admin talk contribs created page Statistics (Created page with "Machine learning (ML) is the study of computer algorithms that can improve automatically through experience and by the use of data. It is seen as a part of artificial intelligence. Machine learning algorithms build a model based on sample data, known as "training data", in order to make predictions or decisions without being explicitly programmed to do so. Machine learning algorithms are used in a wide variety of applications, such as in medicine, email filtering, speech...")
12:01, 10 October 2022 Admin talk contribs created page Stable Marriage Problem/Stable Roommates Problem (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="...")
12:01, 10 October 2022 Admin talk contribs created page Sorting - Non-Comparison (Created page with "== Problem Description== A sorting algorithm is an algorithm that puts elements of a list in a certain order. A Non-Comparison sort doesn't compare actual values of the items. == 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...")
12:01, 10 October 2022 Admin talk contribs created page Sorting - Comparison (Created page with "== Problem Description== A sorting algorithm is an algorithm that puts elements of a list in a certain order. A Comparison sort compares actual values of the items. The best time complexity that can be reached in comparison based sorting is nlogn. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity...")
12:00, 10 October 2022 Admin talk contribs created page Shortest Path(Directed graphs) (Created page with "== Problem Description== The shortest path problem involves finding the shortest path between two vertices (or nodes) in a graph. Algorithms such as the Floyd-Warshall algorithm and different variations of Dijkstra's algorithm are used to find solutions to the shortest path problem. Applications of the shortest path problem include those in road networks, logistics, communications, electronic design, power grid contingency analysis, and community detection. == Bounds...")
12:00, 10 October 2022 Admin talk contribs created page Sequence to Graph Alignment (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...")
12:00, 10 October 2022 Admin talk contribs created page Sequence Alignment (Created page with "== Problem Description== a sequence alignment is a way of arranging the sequences of DNA; RNA; or protein to identify regions of similarity that may be a consequence of functional; structural; or evolutionary relationships between the sequences. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !widt...")
12:00, 10 October 2022 Admin talk contribs created page Self-balancing trees search (Created page with "== Problem Description== A tree is model used to represent hierarchical data. In correspondence to natural trees, it has nodes, leaves and branches. A commonly mentioned tree is a binary tree, in which each node contains leads to two other nodes. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" w...")
12:00, 10 October 2022 Admin talk contribs created page Self-balancing trees insertion (Created page with "== Problem Description== Given a binary tree, delete a node from it by making sure that tree shrinks from the bottom. == 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...")
12:00, 10 October 2022 Admin talk contribs created page Self-balancing trees deletion (Created page with "== Problem Description== Given a binary tree, delete a node from it by making sure that tree shrinks from the bottom. == 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 Li...")
12:00, 10 October 2022 Admin talk contribs created page Self-balancing trees creation (Created page with "== Problem Description== Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keeps height as small as possible when insertion and deletion operations are performed on tree. The height is typically maintained in order of Log n so that all operations take O(Log n) time on average. == Bounds Chart == 1050px == Step Chart == File:Self-balancing_trees_creationStepChart.png|105...")
12:00, 10 October 2022 Admin talk contribs created page Secret-sharing algorithms (Created page with "== Problem Description== Secret Sharing refers to cryptographic methods for taking a secret, breaking it up into multiple shares, and distributing the shares among multiple parties, so that only when the parties bring together their respective shares can the secret be reconstructed. More specifically, the holder of a secret, sometimes referred to as the dealer, creates n shares of a secret and defines a threshold t for the number of shares that are required to reconstruc...")
12:00, 10 October 2022 Admin talk contribs created page Second category integer factoring (Created page with "== Problem Description== A general-purpose factoring algorithm, also known as a Category 2, Second Category, or Kraitchik family algorithm,[9] has a running time which depends solely on the size of the integer to be factored. This is the type of algorithm used to factor RSA numbers. Most general-purpose factoring algorithms are based on the congruence of squares method. == Bounds Chart == 1050px == Step Chart ==...")
12:00, 10 October 2022 Admin talk contribs created page SMAWK 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...")
12:00, 10 October 2022 Admin talk contribs created page SDD Systems Solvers (Created page with "== Problem Description== In mathematics, a square matrix is said to be diagonally dominant if, for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:...")
12:00, 10 October 2022 Admin talk contribs created page Rod-cutting problem (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 | | |- |...")
12:00, 10 October 2022 Admin talk contribs created page Robotics (Created page with "Robotics is an interdisciplinary field that integrates computer science and engineering. Robotics involves design, construction, operation, and use of robots. The goal of robotics is to design machines that can help and assist humans. Robotics integrates fields of mechanical engineering, electrical engineering, information engineering, mechatronics, electronics, bioengineering, computer engineering, control engineering, software engineering, mathematics, among others. R...")
12:00, 10 October 2022 Admin talk contribs created page Representative Algorithms (Created page with "This is a list of representative algorithms - one algorithm from each family that has gained significant traction and is widely accepted as the common solution to the problem. Please note that the ones listed here might not always be the optimal algorithms. == Algorithms == Bubble Sort Radix Sort Hoare's Selection Algorithm Godbole's DP Algorithm Wagner-Fischer Algorithm Edmonds-Karp Algorithm Strassen's Algorithm Lawler's Graph Colo...")
12:00, 10 October 2022 Admin talk contribs created page Register Allocation (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 | | |- |...")
12:00, 10 October 2022 Admin talk contribs created page Recovery (Created page with "== Problem Description== Database recovery is the process of restoring the database to a correct (consistent) state in the event of a failure. In other words, it is the process of restoring the database to the most recent consistent state that existed shortly before the time of system failure. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:...")
12:00, 10 October 2022 Admin talk contribs created page Ramer–Douglas–Peucker 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...")
12:00, 10 October 2022 Admin talk contribs created page Radix Sort (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...")
12:00, 10 October 2022 Admin talk contribs created page Rabin–Scott Powerset Construction (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...")
12:00, 10 October 2022 Admin talk contribs created page Quadratic Sieve (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...")
12:00, 10 October 2022 Admin talk contribs created page Polynomial interpolation (Created page with "== Problem Description== Polynomial interpolation is a method of estimating values between known data points. When graphical data contains a gap, but data is available on either side of the gap or at a few specific points within the gap, an estimate of values within the gap can be made by interpolation. The simplest method of interpolation is to draw straight lines between the known data points and consider the function as the combination of those straight lines. This m...")
12:00, 10 October 2022 Admin talk contribs created page Polygon clipping (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...")
11:59, 10 October 2022 Admin talk contribs created page Point in Polygon (Created page with "== Problem Description== A polygon is a two-dimensional geometric figure that has a finite number of sides. The sides of a polygon are made of straight line segments connected to each other end to end. The line segments of a polygon are called sides or edges. The point where two line segments meet is called vertex or corners, henceforth an angle is formed. An example of a polygon is a triangle with three sides. A circle is also a plane figure but it is not considered a...")
11:59, 10 October 2022 Admin talk contribs created page Parsing (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 | | |- | rowspan="1" | Quadratic...")
11:59, 10 October 2022 Admin talk contribs created page Page replacements (Created page with "== Problem Description== In an operating system that uses paging for memory management, a page replacement algorithm is needed to decide which page needs to be replaced when new page comes in. Page Fault – A page fault happens when a running program accesses a memory page that is mapped into the virtual address space, but not loaded in physical memory. Since actual physical memory is much smaller than virtual memory, page faults happen. In case of page fault, Opera...")
11:59, 10 October 2022 Admin talk contribs created page Operating Systems (Created page with "An operating system (OS) is system software that manages computer hardware, software resources, and provides common services for computer programs. Time-sharing operating systems schedule tasks for efficient use of the system and may also include accounting software for cost allocation of processor time, mass storage, printing, and other resources. For hardware functions such as input and output and memory allocation, the operating system acts as an intermediary betwee...")
11:59, 10 October 2022 Admin talk contribs created page Numerical Analysis (Created page with "Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts. Current growth in computing power has enabled the use of more complex numerical...")
11:59, 10 October 2022 Admin talk contribs created page Non-priority optimal interval Scheduling (Created page with "== Problem Description== Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks. Each task is represented by an interval describing the time in which it needs to be executed. For instance, task A might run from 2:00 to 5:00, task B might run from 4:00 to 10:00 and task C might run from 9:00 to 11:00. A subset of intervals is compatible if no two intervals overlap. For example, the...")
11:59, 10 October 2022 Admin talk contribs created page Nested Loop Join (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...")
11:59, 10 October 2022 Admin talk contribs created page Needleman–Wunsch 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...")
11:59, 10 October 2022 Admin talk contribs created page Nearest Neighbour (Created page with "== Problem Description== K Nearest Neighbour is a simple algorithm that stores all the available cases and classifies the new data or case based on a similarity measure. It is mostly used to classifies a data point based on how its neighbours are classified. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !w...")
11:59, 10 October 2022 Admin talk contribs created page Nash Equilibria (Created page with "== Problem Description== In game theory, the Nash equilibrium, named after the mathematician John Forbes Nash Jr., is a proposed solution of a non-cooperative game involving two or more players in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy. == Bounds Chart == 350px == Step Chart == File:Nash_EquilibriaStepChart.png|35...")
11:59, 10 October 2022 Admin talk contribs created page NFA to DFA conversion (Created page with "== Problem Description== DFA refers to Deterministic Finite Automaton. A Finite Automata(FA) is said to be deterministic, if corresponding to an input symbol, there is single resultant state i.e. there is only one transition. NFA refers to Nondeterministic Finite Automaton. A Finite Automata(FA) is said to be non deterministic, if there is more than one possible transition from one state on the same input symbol. == Bounds Chart == File:NFA_to_DFA_conversionBoundsC...")
11:59, 10 October 2022 Admin talk contribs created page N-Queens Problem (Created page with "== Problem Description== The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. Generate all possible configurations of queens on board and print a configuration that satisfies the given constraints. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="10...")
11:59, 10 October 2022 Admin talk contribs created page Mutual Exclusion (Created page with "== Problem Description== Mutual exclusion is a property of process synchronization which states that “no two processes can exist in the critical section at any given point of time”. The term was first coined by Djikstra. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Clas...")
11:59, 10 October 2022 Admin talk contribs created page Multiplication (Created page with "== Problem Description== Multiplication is one of the four elementary mathematical operations of arithmetic; with the others being addition; subtraction and division. == 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%" | Lo...")
11:59, 10 October 2022 Admin talk contribs created page Motif Search (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 | | |- | rowspan="1" |...")
11:59, 10 October 2022 Admin talk contribs created page Money Change (Created page with "== Problem Description== Given a value N, if we want to make change for N cents, and we have an infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter. For example, for N = 4 and S = {1,2,3}, there are four solutions: {1,1,1,1},{1,1,2},{2,2},{1,3}. So output should be 4. For N = 10 and S = {2, 5, 3, 6}, there are five solutions: {2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5} and {5,5}. So the o...")
11:59, 10 October 2022 Admin talk contribs created page Min. Spanning Tree (Created page with "== Problem Description== The cost of the spanning tree is the sum of the weights of all the edges in the tree. There can be many spanning trees. Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees. There also can be many minimum spanning trees. Minimum spanning tree has direct application in the design of networks. It is used in algorithms approximating the travelling salesman problem, multi-terminal minimum cut problem and...")
11:59, 10 October 2022 Admin talk contribs created page Maximum subarray problem (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...")
11:59, 10 October 2022 Admin talk contribs created page Maximum cut (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 | | |- | rowspan="1" | Qu...")
11:59, 10 October 2022 Admin talk contribs created page Maximum cardinality matching (Created page with "== Problem Description== A graph is bipartite if it has two kinds of nodes and the edges are only allowed between nodes of different kind. We write G=(A,B,E) where A and B are the two sets of nodes and E are the edges of G. A matching in a bipartite graph assigns nodes of A to nodes of B. Matchings in bipartite graphs can be computed more efficiently than matchings in general (=non-bipartite) graphs. Interesting Fact: In a bipartite graph the maximum cardinality of a m...")
11:59, 10 October 2022 Admin talk contribs created page Maximum Flow (Created page with "== Problem Description== 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 circulation problem. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="...")
11:59, 10 October 2022 Admin talk contribs created page Maximum-weight matching (Created page with "== Problem Description== In computer science, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm...")
11:58, 10 October 2022 Admin talk contribs created page Matrix chain multiplication (Created page with "== Problem Description== Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that to find the most efficient way to multiply a given sequence of matrices. The problem is not actually to perform the multiplications but merely to decide the sequence of the matrix multiplications involved. The matrix multiplication is associative as no matter how the product is parenthesized, the result obtained will remain the same. For example...")
11:58, 10 October 2022 Admin talk contribs created page Matrix Multiplication (Created page with "== Problem Description== Matrix multiplication or multiplication of matrices is one of the operations that can be performed on matrices in linear algebra. Multiplication of matrix A with matrix B is possible when both the given matrices, A and B are compatible. Matrix multiplication is a binary operation, that gives a matrix from two given matrices. Matrix multiplication was first introduced in 1812 by French mathematician Jacques Philippe Marie Binet, in order to repre...")
11:58, 10 October 2022 Admin talk contribs created page Matrix Factorization for Collaborative Filtering (Created page with "== Problem Description== Matrix factorization is a way to generate latent features when multiplying two different kinds of entities. Collaborative filtering is the application of matrix factorization to identify the relationship between items’ and users’ entities. With the input of users’ ratings on the shop items, we would like to predict how the users would rate the items so the users can get the recommendation based on the prediction. Collaborative Filtering: C...")
11:58, 10 October 2022 Admin talk contribs created page Main Page/index.php (Redirected page to Main Page) Tag: New redirect
11:58, 10 October 2022 Admin talk contribs created page MDPs for optimal policies (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" | Cub...")
11:58, 10 October 2022 Admin talk contribs created page Lowest common ancestor (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 | |...")
11:58, 10 October 2022 Admin talk contribs created page Lossy compression (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...")
11:58, 10 October 2022 Admin talk contribs created page Longest path on interval graphs (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 | | |- | rowsp...")
11:58, 10 October 2022 Admin talk contribs created page Longest palindromic substring (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="...")
11:58, 10 October 2022 Admin talk contribs created page Longest common subsequence (Created page with "== Problem Description== The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! widt...")
11:58, 10 October 2022 Admin talk contribs created page Logarithm calculations (Created page with "== Problem Description== Logarithms were quickly adopted by scientists because of various useful properties that simplified long, tedious calculations. In particular, scientists could find the product of two numbers m and n by looking up each number’s logarithm in a special table, adding the logarithms together, and then consulting the table again to find the number with that calculated logarithm (known as its antilogarithm). Expressed in terms of common logarithms, th...")
11:58, 10 October 2022 Admin talk contribs created page LogLog 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...")
11:58, 10 October 2022 Admin talk contribs created page Link analysis (PAGERANK and variants) (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...")
11:58, 10 October 2022 Admin talk contribs created page Linear Equations (Created page with "== Problem Description== A linear equation is an equation that is written for two different variables. This equation will be a linear combination of these two variables, and a constant can be present. Surprisingly, when any linear equation is plotted on a graph, it will necessarily produce a straight line - hence the name: Linear equations. A linear equation can be written in different ways. Any simple equation in x and y can be termed as a linear equation if it follow...")
11:58, 10 October 2022 Admin talk contribs created page Line drawing (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 | | |- | rowspan="1" |...")
11:58, 10 October 2022 Admin talk contribs created page Line Intersections (Created page with "== Problem Description== Lines that are non-coincident and non-parallel intersect at a unique point. Lines are said to intersect each other if they cut each other at a point. By Euclid's lemma two lines can have at most 11 point of intersection. To find the intersection of two lines, you first need the equation for each line. At the intersection, xx and yy have the same value for each equation. This means that the equations are equal to each other. We can therefore sol...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11:56, 10 October 2022 Admin talk contribs created page Hash Functions (Redirected page to Databases) Tag: New redirect
11: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;...")
11: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...")
11: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...")
11: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...")
11: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 | |...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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...")
11: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"...")
11: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" |...")
11: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...")
11: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...")
11: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...")
11: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 ==...")
11:55, 10 October 2022 Admin talk contribs created page Doolittle 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...")
11:55, 10 October 2022 Admin talk contribs created page Disk Scheduling (Created page with "== Problem Description== File systems must be accessed in an efficient manner, especially with hard drives, which are the slowest part of a computer. As a computer deals with multiple processes over a period of time, a list of requests to access the disk builds up. For efficiency purposes, all requests (from all processes) are aggregated together. The technique that the operating system uses to determine which requests to satisfy first is called disk scheduling. == Bou...")
11:55, 10 October 2022 Admin talk contribs created page Discrete Fourier Transform (Created page with "== Problem Description== In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| cl...")
11:55, 10 October 2022 Admin talk contribs created page Discovering multivalued dependencies (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 | |...")
11:55, 10 October 2022 Admin talk contribs created page Dijkstra's Algorithm (Created page with "== Algorithm Details == Year : 1956 Family : Shortest Path(Directed graphs) Authors : Edsger W. Dijkstra Paper Link : http://www-m3.ma.tum.de/foswiki/pub/MN0506/WebHome/dijkstra.pdf Time Complexity : == Problem Statement == The Single-Source Shortest Path (SSSP) problem consists of finding the shortest paths between a given vertex v and all other vertices in the graph. == PseudoCode == 1 function Dijkstra(Graph, source): 2 3 create vertex set Q 4 5...")
11:55, 10 October 2022 Admin talk contribs created page Digraph realization problem (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" |...")
11:55, 10 October 2022 Admin talk contribs created page Dependency inference problem (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"...")
11:55, 10 October 2022 Admin talk contribs created page Delaunay triangulation (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 | |...")
11:55, 10 October 2022 Admin talk contribs created page Dekker'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...")
11:55, 10 October 2022 Admin talk contribs created page Decade Analysis (Created page with "This analysis presents the average annualized improvement rate for problem sizes of 1 thousand, 1 million, and 1 billion and contrasts them with the average improvement rate in hardware as measured by the SPECInt benchmark.\cite{CompArch} As these graphs show, there are two large clusters of algorithm families and then some intermediate values. The first cluster, representing just under half the families, shows little to no improvement even for large problem sizes. Th...")
11:55, 10 October 2022 Admin talk contribs created page Deadlock avoidance (Created page with "== Problem Description== The deadlock Avoidance method is used by the operating system in order to check whether the system is in a safe state or in an unsafe state and in order to avoid the deadlocks, the process must need to tell the operating system about the maximum number of resources a process can request in order to complete its execution. == Bounds Chart == 1050px == Step Chart == File:Deadlock_avoidanceStepChart.png...")
11:55, 10 October 2022 Admin talk contribs created page De Bruijn Graph (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...")
11:55, 10 October 2022 Admin talk contribs created page Databases (Created page with "In computing, a database is an organized collection of data stored and accessed electronically from a computer system. Where databases are more complex they are often developed using formal design and modeling techniques. The database management system (DBMS) is the software that interacts with end users, applications, and the database itself to capture and analyze the data. The DBMS software additionally encompasses the core facilities provided to administer the databa...")
11:55, 10 October 2022 Admin talk contribs created page DFA Minimization (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...")
11:55, 10 October 2022 Admin talk contribs created page DE NOVO GENOME ASSEMBLY (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 |...")
11:55, 10 October 2022 Admin talk contribs created page Cyclopeptide sequencing (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 |...")
11:55, 10 October 2022 Admin talk contribs created page Cycle Detection (Created page with "== Problem Description== cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values. == 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 Li...")
11:55, 10 October 2022 Admin talk contribs created page Cryptography (Created page with "Cryptography is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages; various aspects in information security such as data confidentiality, data integrity, authentication, and non-repudiation are central to modern cryptography. Modern cryptography exists at the intersection of t...")
11:55, 10 October 2022 Admin talk contribs created page Cryptanalysis of Linear Feedback Shift Registers (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="...")
11:55, 10 October 2022 Admin talk contribs created page Coset Enumeration (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...")
11:54, 10 October 2022 Admin talk contribs created page Convex Hull (Created page with "== Problem Description== The Convex Hull is the line completely enclosing a set of points in a plane so that there are no concavities in the line. More formally, we can describe it as the smallest convex polygon which encloses a set of points such that each point in the set lies within the polygon or on its perimeter. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class...")
11:54, 10 October 2022 Admin talk contribs created page Constructing suffix trees (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" | Cub...")
11:54, 10 October 2022 Admin talk contribs created page Constructing Eulerian trails in a Graph (Created page with "== Problem Description== In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices). Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex. == Bounds Chart == 350px == Step Chart == 350px == Impr...")
11:54, 10 October 2022 Admin talk contribs created page Constants (Created page with "In our research, we have approximated the number of steps that an algorithm needs to perform by looking at its asymptotic complexity, which drops any leading constants or smaller-order terms.For any reasonable problem sizes, simplifying to the highest order term is likely to be a good approximation. But dropping the leading constant may be worrisome if complexity class improvements come with inflation in the size of the leading constant. One particularly important exampl...")
11:54, 10 October 2022 Admin talk contribs created page Computer Networking (Created page with "A computer network is a set of computers sharing resources located on or provided by network nodes. The computers use common communication protocols over digital interconnections to communicate with each other. These interconnections are made up of telecommunication network technologies, based on physically wired, optical, and wireless radio-frequency methods that may be arranged in a variety of network topologies. The nodes of a computer network may include personal co...")
11:54, 10 October 2022 Admin talk contribs created page Cohen–Sutherland 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...")
11:54, 10 October 2022 Admin talk contribs created page Closest Pair Problem (Created page with "== Problem Description== We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Recall the following formula for distance between two points p and q. == Bounds Chart == File:Closest_Pair_ProblemBoundsChart.png|1050...")
11:54, 10 October 2022 Admin talk contribs created page Chatlin'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...")
11:54, 10 October 2022 Admin talk contribs created page Bubble Sort (Created page with "== Algorithm Details == Year : 1956 Family : Sorting - Comparison Authors : NA Paper Link : NA Time Complexity : == Problem Statement == Bubble sort is a simple sorting algorithm. This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order. This algorithm is not suitable for large data sets as its average and worst case complexity are quadratic where n is the numb...")
11:54, 10 October 2022 Admin talk contribs created page Bruun's FFT 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...")
11:54, 10 October 2022 Admin talk contribs created page Bron–Kerbosch 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...")
11:54, 10 October 2022 Admin talk contribs created page Bresenham's Line 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...")
11:54, 10 October 2022 Admin talk contribs created page Bowyer–Watson 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...")
11:54, 10 October 2022 Admin talk contribs created page BioInformatics (Created page with "Bioinfromatics an interdisciplinary field that develops methods and software tools for understanding biological data, in particular when the data sets are large and complex. As an interdisciplinary field of science, bioinformatics combines biology, computer science, information engineering, mathematics and statistics to analyze and interpret the biological data. Bioinformatics has been used for in silico analyses of biological queries using mathematical and statistical t...")
11:54, 10 October 2022 Admin talk contribs created page Bentley-Ottmann 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...")
11:54, 10 October 2022 Admin talk contribs created page Bellman-Ford 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...")
11:54, 10 October 2022 Admin talk contribs created page BCNF Decomposition (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 | | |- | ro...")
11:54, 10 October 2022 Admin talk contribs created page All permutations (Created page with "== Problem Description== All permutations of an input string. == 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 | | |- |...")
11:54, 10 October 2022 Admin talk contribs created page All-pairs shortest paths (Undirected) (Created page with "== Problem Description== It aims to figure out the shortest path from each vertex v to every other u. Storing all the paths explicitly can be very memory expensive indeed, as we need one spanning tree for each vertex. This is often impractical regarding memory consumption, so these are generally considered as all pairs-shortest distance problems, which aim to find just the distance from each to each node to another. We usually want the output in tabular form: the entry i...")
11:53, 10 October 2022 Admin talk contribs created page Algorithm Families (Created page with "query")
11:53, 10 October 2022 Admin talk contribs created page About Algorithm-Wiki (Created page with "query")
11:53, 10 October 2022 Admin talk contribs created page ADI Iteration (Created page with "query")
11:53, 10 October 2022 Admin talk contribs created page A* Informed Search (Created page with "query")
11:53, 10 October 2022 Admin talk contribs created page A* Algorithm (Created page with "query")
11:53, 10 October 2022 Admin talk contribs created page 4 - Graph Coloring (Created page with "query")
11:52, 10 October 2022 Admin talk contribs created page 4NF decomposition (Created page with "query")
11:52, 10 October 2022 Admin talk contribs created page 3 - Graph Coloring (Created page with "query")
15:15, 7 October 2022 Admin talk contribs created page File:Hh2.png
15:15, 7 October 2022 Admin talk contribs uploaded File:Hh2.png
14:21, 7 October 2022 Admin talk contribs imported Main Page by file upload (1 revision)
13:32, 7 October 2022 MediaWiki default talk contribs created page Main Page Tag: Reverted

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

All public logs

Navigation menu

Search