New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 100 | older 100) (20 | 50 | 100 | 250 | 500)
- 11:17, 15 February 2023 Approximate MCSP (hist | edit) [1,377 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Approximate MCSP (Matrix Chain Multiplication)}} == Description == The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem� where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system. In the approximation problem, the matrix multiplication carried out with the output result will use a number of opera...")
- 11:17, 15 February 2023 Matrix Chain Scheduling Problem (hist | edit) [1,194 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Chain Scheduling Problem (Matrix Chain Multiplication)}} == Description == The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem� where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system. == Related Problems == Generalizations: Matrix Chain Ordering Problem Subproblem: Approximat...")
- 11:17, 15 February 2023 Approximate MCOP (hist | edit) [2,012 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Approximate MCOP (Matrix Chain Multiplication)}} == Description == Matrix chain multiplication (or Matrix Chain Ordering Problem; MCOP) is an optimization problem. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices. In the approximation problem, the matrix multiplication carried out with the output result will use a number of operations that has some sort of upper bound based on the optimal solution. == R...")
- 11:17, 15 February 2023 Matrix Chain Ordering Problem (hist | edit) [1,541 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Chain Ordering Problem (Matrix Chain Multiplication)}} == Description == Matrix chain multiplication (or Matrix Chain Ordering Problem; MCOP) is an optimization problem. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices. == Related Problems == Subproblem: Approximate MCOP, Matrix Chain Scheduling Problem Related: Matrix Chain Scheduling Problem, Approximate MCSP == Parameters...")
- 11:17, 15 February 2023 Kth Order Statistic (hist | edit) [1,166 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:kth Order Statistic (kth Order Statistic)}} == Description == An algorithm seeks to find the $k^{th}$ order statistic of a statistical sample, or the $k^{th}$-smallest value in a list or array. == Parameters == <pre>n: size of list</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Naive Selection (kth Order St...")
- 11:17, 15 February 2023 Non-Comparison Sorting (hist | edit) [2,528 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Non-Comparison Sorting (Sorting)}} == Description == A sorting algorithm is an algorithm that puts elements of a list in a certain order, not using comparisons between elements (so elements are typically integers or real numbers). == Related Problems == Generalizations: Sorting Related: Comparison Sorting == Parameters == <pre>n: size of list</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width...")
- 11:17, 15 February 2023 Comparison Sorting (hist | edit) [5,958 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Comparison Sorting (Sorting)}} == Description == A sorting algorithm is an algorithm that puts elements of a list in a certain order, using comparisons between elements. == Related Problems == Generalizations: Sorting Related: Non-Comparison Sorting == Parameters == <pre>n: size of list</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation...")
- 11:17, 15 February 2023 Sorting (hist | edit) [5,924 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Sorting (Sorting)}} == Description == A sorting algorithm is an algorithm that puts elements of a list in a certain order == Related Problems == Subproblem: Comparison Sorting, Non-Comparison Sorting Related: Non-Comparison Sorting == Parameters == <pre>n: size of list</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Time Complexity graph == 1000px ==...")
- 11:17, 15 February 2023 Family:3SUM (hist | edit) [193 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:3SUM}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3SUM * 3SUM' * All-Integers 3SUM * Real 3SUM")
- 11:17, 15 February 2023 Family:Dihedral Rotation Queries (hist | edit) [230 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Dihedral Rotation Queries}}== Description == Currently no description in our database for the given family. == Problems Variations == * Dynamic Dihedral Rotation Queries * Static Dihedral Rotation Queries")
- 11:17, 15 February 2023 Family:Model-Checking Problem (hist | edit) [510 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Model-Checking Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Conjunctive Reachability Queries in MDPs * Conjunctive Safety Queries in MDPs * Disjunctive Queries of Safety in Graphs * Disjunctive Reachability Queries in MDPs * Disjunctive Safety Queries in MDPs * Disjunctive coBüchi Objectives * Generalized Büchi Games * Reachability in MDPs * Safe...")
- 11:17, 15 February 2023 Family:Vertex Reachability (hist | edit) [360 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Vertex Reachability}}== Description == Currently no description in our database for the given family. == Problems Variations == * #SSR * 1-sensitive incremental ss-reach * 2-sensitive incremental st-reach * ST-Reach * ap-reach * constant sensitivity incremental ST-Reach * sensitive incremental #SSR * st-Reach")
- 11:17, 15 February 2023 Family:Matrix-Vector Multiplication (hist | edit) [245 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix-Vector Multiplication}}== Description == Currently no description in our database for the given family. == Problems Variations == * Online Matrix-Vector Multiplication * Online Vector-Matrix-Vector Multiplication")
- 11:17, 15 February 2023 Family:Graph Cycles (hist | edit) [182 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Cycles}}== Description == Currently no description in our database for the given family. == Problems Variations == * Shortest Cycle * Shortest k-Cycle")
- 11:17, 15 February 2023 Family:Minimum Witness (hist | edit) [203 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Minimum Witness}}== Description == Currently no description in our database for the given family. == Problems Variations == * All Pairs Minimum Witness * Minimum Witness Finding")
- 11:17, 15 February 2023 Family:Local Alignment (hist | edit) [194 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Local Alignment}}== Description == Currently no description in our database for the given family. == Problems Variations == * Local Alignment * Multiple Local Alignment")
- 11:17, 15 February 2023 Family:Motion Planning Problems (hist | edit) [204 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Motion Planning Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3D Motion Planning * Planar Motion Planning")
- 11:17, 15 February 2023 Family:Geometric Visibility Problems (hist | edit) [243 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Visibility Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Visibility Between Segments * Visibility From Infinity * Visible Triangle")
- 11:17, 15 February 2023 Family:Geometric Covering Problems (hist | edit) [319 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Covering Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Hole in Union * Max-Weight Rectangle * Point Covering * Strips Cover Box * Triangle Measure * Triangles Cover Triangle * Weighted Depth")
- 11:17, 15 February 2023 Family:Geometric Separator Problems (hist | edit) [188 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Separator Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Separator1 * Separator2")
- 11:17, 15 February 2023 Family:Geometric Incidence Problems (hist | edit) [200 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Geometric Incidence Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3 Points on Line * Point on 3 Lines")
- 11:17, 15 February 2023 Family:Graph Triangle Problems (hist | edit) [385 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Triangle Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Minimum Triangle * Negative Triangle Detection * Negative Triangle Listing * Negative Triangle Search * Nondecreasing Triangle * Triangle Collection* * Triangle Detection * Triangle in Unweighted Graph")
- 11:17, 15 February 2023 Family:Vertex Centrality (hist | edit) [560 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Vertex Centrality}}== Description == Currently no description in our database for the given family. == Problems Variations == * All-Nodes Median Parity * Approximate Betweenness Centrality * Approximate Reach Centrality * Betweenness Centrality * Directed All-Nodes Positive Betweenness Centrality * Directed All-Nodes Reach Centrality * Eccentricity * Positive Betweenness Centrality * Reach Centrality * Undirected Al...")
- 11:17, 15 February 2023 Family:Graph Metrics (hist | edit) [501 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Metrics}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1-sensitive (4/3)-approximate decremental diameter * 1-sensitive (4/3)-approximate decremental eccentricity * 1-sensitive decremental diameter * Approximate Diameter * Decremental Diameter * Diameter * Diameter 2 vs 3 * Diameter 3 vs 7 * Median * Radius * constant sensitivity (4/3)-approxim...")
- 11:17, 15 February 2023 Family:Orthogonal Vectors (hist | edit) [195 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Orthogonal Vectors}}== Description == Currently no description in our database for the given family. == Problems Variations == * 3-OV * OV * Unbalanced OV * k-OV")
- 11:17, 15 February 2023 Family:Boolean Satisfiability (hist | edit) [577 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Satisfiability}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1-in-3SAT * 2SAT * 3SAT * 3SAT-5 * 4SAT * All-Equal-SAT * Conjunctive Normal Form SAT * Disjunctive Normal Form SAT * Dual-Horn SAT * Horn SAT * MaxSAT * Monotone 1-in-3SAT * Monotone 3SAT * Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) * Monotone Not-Exactly-1-i...")
- 11:17, 15 February 2023 Family:Graph Coloring (hist | edit) [398 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Coloring}}== Description == Currently no description in our database for the given family. == Problems Variations == * #2-Graph Coloring * #3-Graph Coloring * #4-Graph Coloring * #5-Graph Coloring * #k-Graph Coloring * 2-Graph Coloring * 3-Graph Coloring * 4-Graph Coloring * 5-Graph Coloring * Chromatic Number * k-Graph Coloring")
- 11:16, 15 February 2023 Family:Recovery (hist | edit) [178 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Recovery}}== Description == Currently no description in our database for the given family. == Problems Variations == * No-Steal/Force * Steal/No-Force")
- 11:16, 15 February 2023 Family:Page Replacements (hist | edit) [170 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Page Replacements}}== Description == Currently no description in our database for the given family. == Problems Variations == * Offline * Online")
- 11:16, 15 February 2023 Family:Deadlock Avoidance (hist | edit) [203 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Deadlock Avoidance}}== Description == Currently no description in our database for the given family. == Problems Variations == * Deadlock Avoidance * Dining Philosophers Problem")
- 11:16, 15 February 2023 Family:Interval Scheduling (hist | edit) [288 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Interval Scheduling}}== Description == Currently no description in our database for the given family. == Problems Variations == * Unweighted Interval Scheduling * Weighted Interval Schedule Maximization Problem (ISMP)")
- 11:16, 15 February 2023 Family:One-Way Hash Functions (hist | edit) [204 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:One-Way Hash Functions}}== Description == Currently no description in our database for the given family. == Problems Variations == * Keyed Hash Functions * Unkeyed Hash Functions")
- 11:16, 15 February 2023 Family:Integral Equations (hist | edit) [194 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integral Equations}}== Description == Currently no description in our database for the given family. == Problems Variations == * Fredholm Equations * Volterra Equations")
- 11:16, 15 February 2023 Family:Median String Problem (hist | edit) [301 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Median String Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Median String Problem with Binary Alphabets * Median String Problem with Bounded Alphabets * Median String Problem with Unbounded Alphabets")
- 11:16, 15 February 2023 Family:n-Queens Problem (hist | edit) [222 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:n-Queens Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Constructing Solutions * Counting Solutions * n-Queens Completion")
- 11:16, 15 February 2023 Family:Integer Relation (hist | edit) [215 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integer Relation}}== Description == Currently no description in our database for the given family. == Problems Variations == * Integer Relation Among Integers * Integer Relation Among Reals")
- 11:16, 15 February 2023 Family:Wiener Index (hist | edit) [207 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Wiener Index}}== Description == Currently no description in our database for the given family. == Problems Variations == * Minimum Wiener Connector Problem * Undirected Wiener Index")
- 11:16, 15 February 2023 Family:Texture Mapping (hist | edit) [218 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Texture Mapping}}== Description == Currently no description in our database for the given family. == Problems Variations == * Diffuse Reflection * Environment Mapping * Specular Reflection")
- 11:15, 15 February 2023 Family:Link Analysis (hist | edit) [183 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Link Analysis}}== Description == Currently no description in our database for the given family. == Problems Variations == * InDegree Analysis * Link Analysis")
- 11:15, 15 February 2023 Family:The Set-Covering Problem (hist | edit) [208 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:The Set-Covering Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Unweighted Set-Covering * Weighted Set-Covering")
- 11:15, 15 February 2023 Family:Feature Detection (hist | edit) [187 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Feature Detection}}== Description == Currently no description in our database for the given family. == Problems Variations == * Blob Detection * Corner Detection")
- 11:15, 15 February 2023 Family:Graph Realization Problems (hist | edit) [216 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Realization Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * DAG Realization Problem * Digraph Realization Problem")
- 11:15, 15 February 2023 Family:Graph Isomorphism Problem (hist | edit) [403 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Graph Isomorphism, Bounded Number of Vertices of Each Color * Graph Isomorphism, Bounded Vertex Valences * Graph Isomorphism, General Graphs * Graph Isomorphism, Trivalent Graphs * Largest Common Subtree * Subtree Isomorphism")
- 11:15, 15 February 2023 Family:AST to Code Translation (hist | edit) [219 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:AST to Code Translation}}== Description == Currently no description in our database for the given family. == Problems Variations == * AST to Code Translation * Arithmetic Expression Binary Tree")
- 11:15, 15 February 2023 Family:Maximum Subarray Problem (hist | edit) [255 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Subarray Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1D Maximum Subarray * 2D Maximum Subarray * Maximum Square Subarray * Maximum Subarray")
- 11:15, 15 February 2023 Family:Stable Matching Problem (hist | edit) [351 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Matching Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Almost Stable Marriage Problem * Boolean d-Attribute Stable Matching * Stable Marriage Problem * Stable Matching Verification * Stable Pair Checking * Stable Roommates Problem")
- 11:15, 15 February 2023 Family:Data Compression (hist | edit) [193 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Data Compression}}== Description == Currently no description in our database for the given family. == Problems Variations == * Lossless Compression * Lossy Compression")
- 11:15, 15 February 2023 Family:CFG Problems (hist | edit) [178 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:CFG Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * CFG Parsing * CFG Recognition")
- 11:15, 15 February 2023 Family:The Vertex Cover Problem (hist | edit) [234 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:The Vertex Cover Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * The Vertex Cover Problem * The Vertex Cover Problem, Degrees Bounded By 3")
- 11:15, 15 February 2023 Family:4NF Decomposition (hist | edit) [296 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:4NF Decomposition}}== Description == Currently no description in our database for the given family. == Problems Variations == * 4NF Decomposition * 4NF Decomposition for Conflict-Free Dependency Sets * 4NF Decomposition for Functional and Multivalued Dependency Sets")
- 11:15, 15 February 2023 Family:BCNF Decomposition (hist | edit) [191 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:BCNF Decomposition}}== Description == Currently no description in our database for the given family. == Problems Variations == * BCNF Decomposition * Decisional BCNF")
- 11:15, 15 February 2023 Family:Dependency Inference Problem (hist | edit) [247 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Dependency Inference Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Functional Dependency Inference Problem * Multivalued Dependency Inference Problem")
- 11:15, 15 February 2023 Family:Poisson Problem (hist | edit) [213 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Poisson Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * 2-Dimensional Poisson Problem * 3-Dimensional Poisson Problem")
- 11:14, 15 February 2023 Family:The Traveling-Salesman Problem (hist | edit) [214 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:The Traveling-Salesman Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * Approximate TSP * Maximum TSP * Minimum TSP")
- 11:14, 15 February 2023 Family:Clique Problems (hist | edit) [280 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Clique Problems}}== Description == Currently no description in our database for the given family. == Problems Variations == * Enumerating Maximal Cliques, arbitrary graph * Exact k-Clique * Max-Weight k-Clique * Min-Weight k-Clique * k-Clique")
- 11:14, 15 February 2023 Family:Graph Edit Distance Computation (hist | edit) [191 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Edit Distance Computation}}== Description == Currently no description in our database for the given family. == Problems Variations == * Exact GED * Inexact GED")
- 11:14, 15 February 2023 Family:Lowest Common Ancestor (hist | edit) [407 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Lowest Common Ancestor}}== Description == Currently no description in our database for the given family. == Problems Variations == * Lowest Common Ancestor * Lowest Common Ancestor with Linking * Lowest Common Ancestor with Linking Roots * Lowest Common Ancestor with Static Trees * Lowest Common Ancestors with Linking and Cutting * Off-Line Lowest Common Ancestor")
- 11:14, 15 February 2023 Family:DFA Minimization (hist | edit) [242 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:DFA Minimization}}== Description == Currently no description in our database for the given family. == Problems Variations == * Acyclic DFA Minimization * Cyclic Nontrivial SCCs DFA Minimization * DFA Minimization")
- 11:14, 15 February 2023 Family:Register Allocation (hist | edit) [210 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Register Allocation}}== Description == Currently no description in our database for the given family. == Problems Variations == * Global Register Allocation * Local Register Allocation")
- 11:14, 15 February 2023 Family:Nearest Neighbor Search (hist | edit) [279 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Nearest Neighbor Search}}== Description == Currently no description in our database for the given family. == Problems Variations == * k Approximate Nearest Neighbors Search * k Nearest Neighbors Search")
- 11:14, 15 February 2023 Family:Root Computation (hist | edit) [229 bytes] Admin (talk | contribs) (Redirected page to Root Computation) Tag: New redirect
- 11:14, 15 February 2023 Family:Eigenvalues (Iterative Methods) (hist | edit) [315 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Eigenvalues (Iterative Methods)}}== Description == Currently no description in our database for the given family. == Problems Variations == * All Eigenpairs * All Eigenvalues * Any Eigenpair * Any Eigenvalue * Eigenpair closest to mu * Eigenpair with the Largest Eigenvalue")
- 11:14, 15 February 2023 Family:Polygon Clipping (hist | edit) [249 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Polygon Clipping}}== Description == Currently no description in our database for the given family. == Problems Variations == * Polygon Clipping with Arbitrary Clipping Polygon * Polygon Clipping with Convex Clipping Polygon")
- 11:14, 15 February 2023 Family:Maximum-Weight Matching (hist | edit) [219 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum-Weight Matching}}== Description == Currently no description in our database for the given family. == Problems Variations == * Bipartite Maximum-Weight Matching * Maximum-Weight Matching")
- 11:14, 15 February 2023 Family:Nash Equilibria (hist | edit) [171 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Nash Equilibria}}== Description == Currently no description in our database for the given family. == Problems Variations == * 2-Player * n-Player")
- 11:14, 15 February 2023 Family:Optimal Binary Search Trees (hist | edit) [270 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Optimal Binary Search Trees}}== Description == Currently no description in our database for the given family. == Problems Variations == * Alphabetic Tree Problem * Approximate OBST * Huffman Encoding * Optimal Binary Search Tree Problem")
- 11:14, 15 February 2023 Family:Generating Random Permutations (hist | edit) [209 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Generating Random Permutations}}== Description == Currently no description in our database for the given family. == Problems Variations == * Cyclic Permutations * General Permutations")
- 11:14, 15 February 2023 Family:SDD Systems Solvers (hist | edit) [205 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:SDD Systems Solvers}}== Description == Currently no description in our database for the given family. == Problems Variations == * Exact Laplacian Solver * Inexact Laplacian Solver")
- 11:14, 15 February 2023 Family:Maximum Cardinality Matching (hist | edit) [250 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Cardinality Matching}}== Description == Currently no description in our database for the given family. == Problems Variations == * Bipartite Graph MCM * General Graph MCM * Planar Bipartite Graph Perfect Matching")
- 11:14, 15 February 2023 Family:Line Clipping (hist | edit) [225 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Line Clipping}}== Description == Currently no description in our database for the given family. == Problems Variations == * Convex Polygonal Window * Convex Polyhedral Window * Rectangular Window")
- 11:14, 15 February 2023 Family:Sequence Alignment (hist | edit) [232 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Sequence Alignment}}== Description == Currently no description in our database for the given family. == Problems Variations == * Edit Distance, constant-size alphabet * Edit Sequence, constant-size alphabet")
- 11:14, 15 February 2023 Family:String Search (hist | edit) [195 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:String Search}}== Description == Currently no description in our database for the given family. == Problems Variations == * Multiple String Search * Single String Search")
- 11:13, 15 February 2023 Family:LU Decomposition (hist | edit) [221 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:LU Decomposition}}== Description == Currently no description in our database for the given family. == Problems Variations == * Rectangular Matrix LU Decomposition * Square Matrix LU Decomposition")
- 11:13, 15 February 2023 Family:Integer Factoring (hist | edit) [189 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integer Factoring}}== Description == Currently no description in our database for the given family. == Problems Variations == * Integer Factoring * Smallest Factor")
- 11:13, 15 February 2023 Family:All-Pairs Shortest Paths (APSP) (hist | edit) [827 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:All-Pairs Shortest Paths (APSP)}}== Description == Currently no description in our database for the given family. == Problems Variations == * (5/3)-approximate ap-shortest paths * APSP * APSP on Dense Directed Graphs with Arbitrary Weights * APSP on Dense Directed Unweighted Graphs * APSP on Dense Undirected Graphs with Arbitrary Weights * APSP on Dense Undirected Graphs with Positive Integer Weights * APSP on Dense Undirected...")
- 11:13, 15 February 2023 Family:Shortest Path (Directed Graphs) (hist | edit) [532 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Shortest Path (Directed Graphs)}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1-sensitive (3/2)-approximate ss-shortest paths * 1-sensitive decremental st-shortest paths * 2-sensitive (7/5)-approximate st-shortest paths * 2-sensitive decremental st-shortest paths * General Weights * Nonnegative Integer Weights * Nonnegative Weights * Replacement Paths Problem...")
- 11:13, 15 February 2023 Family:Closest Pair Problem (hist | edit) [339 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Closest Pair Problem}}== Description == Currently no description in our database for the given family. == Problems Variations == * 2-dimensional array representation * 2-dimensional space, $l_m$ (or $l_\infty$) norm * 2-dimensional space, Euclidean metric * k-dimensional space, $l_m$ (or $l_\infty$) norm")
- 11:12, 15 February 2023 Family:Minimum Spanning Tree (MST) (hist | edit) [380 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Minimum Spanning Tree (MST)}}== Description == Currently no description in our database for the given family. == Problems Variations == * Directed (Optimum Branchings), General MST * Directed (Optimum Branchings), Super Dense MST * Undirected, Dense MST * Undirected, General MST * Undirected, Integer Weights MST * Undirected, Planar MST")
- 11:12, 15 February 2023 Family:Strongly Connected Components (hist | edit) [356 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Strongly Connected Components}}== Description == Currently no description in our database for the given family. == Problems Variations == * 2 Strong Components (dynamic) * Connected Subgraph * Maximum Strongly Connected Component * Strong Connectivity (dynamic) * Strongly Connected Components * Transitive Closure")
- 11:12, 15 February 2023 Family:Convex Hull (hist | edit) [314 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Convex Hull}}== Description == Currently no description in our database for the given family. == Problems Variations == * 2-dimensional Convex Hull * 2-dimensional Convex Hull, Dynamic * 2-dimensional Convex Hull, Online * 3-dimensional Convex Hull * d-dimensional Convex Hull")
- 11:12, 15 February 2023 Family:Line segment intersection (hist | edit) [443 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Line segment intersection}}== Description == Currently no description in our database for the given family. == Problems Variations == * Counting number of intersection points, line segments * Reporting all intersection points, convex polygons * Reporting all intersection points, general polygons * Reporting all intersection points, generalized segments * Reporting all intersection points, line segments")
- 11:12, 15 February 2023 Family:Linear Programming (hist | edit) [275 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Linear Programming}}== Description == Currently no description in our database for the given family. == Problems Variations == * 0-1 Linear Programming * General Linear Programming * Integer Linear Programming * Linear Programming with Reals")
- 11:12, 15 February 2023 Family:Linear System (hist | edit) [320 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Linear System}}== Description == Currently no description in our database for the given family. == Problems Variations == * General Linear System * Non-Definite, Symmetric Matrix * Positive Definite, Hermitian Matrix * Sparse Linear System * Toeplitz Matrix * Vandermonde Matrix")
- 11:12, 15 February 2023 Family:Matrix Product (hist | edit) [342 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Product}}== Description == Currently no description in our database for the given family. == Problems Variations == * $(\min, \leq)$ Product * Boolean Matrix Multiplication * Boolean Matrix Multiplication (Combinatorial) * Distance Product * Matrix Multiplication * Matrix Product Verification")
- 11:12, 15 February 2023 Family:Maximum Flow (hist | edit) [339 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Flow}}== Description == Currently no description in our database for the given family. == Problems Variations == * All-Pairs Maximum Flow * Integer Maximum Flow * Maximum Local Edge Connectivity * Minimum-Cost Flow * Non-integer Maximum Flow * Unweighted Maximum Flow * st-Maximum Flow")
- 11:12, 15 February 2023 Family:Longest Common Subsequence (hist | edit) [233 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Common Subsequence}}== Description == Currently no description in our database for the given family. == Problems Variations == * Longest Common Subsequence * Longest Common Substring with don't cares")
- 11:12, 15 February 2023 Family:Matrix Chain Multiplication (hist | edit) [273 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Chain Multiplication}}== Description == Currently no description in our database for the given family. == Problems Variations == * Approximate MCOP * Approximate MCSP * Matrix Chain Ordering Problem * Matrix Chain Scheduling Problem")
- 11:11, 15 February 2023 Family:Sorting (hist | edit) [201 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Sorting}}== Description == Currently no description in our database for the given family. == Problems Variations == * Comparison Sorting * Non-Comparison Sorting * Sorting")
- 11:11, 15 February 2023 Domain:Cryptography (hist | edit) [3,125 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Cryptography}}== Description == 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. Mod...")
- 11:11, 15 February 2023 Domain:Statistics (hist | edit) [1,551 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Statistics}}== Description == 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...")
- 11:11, 15 February 2023 Domain:Robotics (hist | edit) [2,546 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Robotics}}== Description == 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, softwar...")
- 11:11, 15 February 2023 Domain:Operating Systems (hist | edit) [2,630 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Operating Systems}}== Description == 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...")
- 11:11, 15 February 2023 Domain:Numerical Analysis (hist | edit) [3,113 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Numerical Analysis}}== Description == 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 computi...")
- 11:11, 15 February 2023 Domain:Image Processing (hist | edit) [2,251 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Image Processing}}== Description == 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...")
- 11:11, 15 February 2023 Domain:Databases (hist | edit) [1,423 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Databases}}== Description == 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...")
- 11:11, 15 February 2023 Domain:Combinatorics (hist | edit) [5,333 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Combinatorics}}== Description == == Problems Within Domain == * #2-Graph Coloring * #3-Graph Coloring * #4-Graph Coloring * #5-Graph Coloring * #k-Graph Coloring * $(\min, \leq)$ Product * (5/3)-approximate ap-shortest paths * 1-sensitive (3/2)-approximate ss-shortest paths * 1-sensitive decremental st-shortest paths * 1D Maximum Subarray * 2 Strong Components (dynamic) * 2-Graph Coloring * 2-sensitive...")
- 11:11, 15 February 2023 Domain:Bioinformatics (hist | edit) [1,524 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Bioinformatics}}== Description == 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 biolo...")
- 11:11, 15 February 2023 List:Domains (hist | edit) [437 bytes] Admin (talk | contribs) (Created page with "* Bioinformatics * Combinatorics * Databases * Image Processing * Numerical Analysis * Operating Systems * Robotics * Signal Processing * Statistics * Cryptography")
- 11:11, 15 February 2023 List:Hypotheses (hist | edit) [1,697 bytes] Admin (talk | contribs) (Created page with "* Exponential Time Hypothesis (ETH) * Strong Exponential Time Hypothesis (SETH) * Orthogonal Vectors Hypothesis (OVH) * Unbalanced Orthogonal Vectors Hypothesis (UOVH) * k-OV Hypothesis * k-Clique Hypothesis * 3SUM Hypothesis (3-SUM Hypothes...")
- 11:11, 15 February 2023 List:Problem Families (hist | edit) [10,798 bytes] Admin (talk | contribs) (Created page with "== Bioinformatics == <ul style="display: grid; grid-template-columns: repeat(2, minmax(0, 1fr));"> <li> All Maximal Non-Branching Paths in a Graph</li> <li> Cyclic Peptide Sequencing Problem</li> <li> De Novo Genome Assembly</li> <li> Motif Search</li> <li>Family:Sequence Alignme...")