All public logs

Jump to navigation Jump to search

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

Logs
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
  • 11:08, 10 October 2022 Admin talk contribs created page File:4 - Graph ColoringBoundsChart.png
  • 11:08, 10 October 2022 Admin talk contribs uploaded File:4 - Graph ColoringBoundsChart.png
  • 11:08, 10 October 2022 Admin talk contribs created page File:4NF decompositionStepChart.png
  • 11:08, 10 October 2022 Admin talk contribs uploaded File:4NF decompositionStepChart.png
  • 11:08, 10 October 2022 Admin talk contribs created page File:4NF decompositionBoundsChart.png
  • 11:08, 10 October 2022 Admin talk contribs uploaded File:4NF decompositionBoundsChart.png
  • 11:08, 10 October 2022 Admin talk contribs created page File:3 - Graph ColoringStepChart.png
  • 11:08, 10 October 2022 Admin talk contribs uploaded File:3 - Graph ColoringStepChart.png
  • 11:08, 10 October 2022 Admin talk contribs created page File:3 - Graph ColoringBoundsChart.png
  • 11:08, 10 October 2022 Admin talk contribs uploaded File:3 - Graph ColoringBoundsChart.png
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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=...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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"...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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 | |...")
  • 11: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...")
  • 11: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 k­mers 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 | |...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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="...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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...")
  • 11: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 ==...")
  • 11: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...")
  • 11: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:...")
  • 11: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 | | |- |...")
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:Log"