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).
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)- 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