New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:24, 15 February 2023 Maximum Likelihood Methods in Unknown Latent Variables (hist | edit) [3,607 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Likelihood Methods in Unknown Latent Variables (Maximum Likelihood Methods in Unknown Latent Variables)}} == Description == In this problem, the goal is to compute maximum-likelihood estimates when the observations can be viewed as incomplete data. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !!...")
- 10:24, 15 February 2023 Mesh Parameterization (hist | edit) [5,660 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Mesh Parameterization (Mesh Parameterization)}} == Description == Given any two surfaces with similar topology it is possible to compute a one-to-one and onto mapping between them. If one of these surfaces is represented by a triangular mesh, the problem of computing such a mapping is referred to as mesh parameterization. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width=...")
- 10:24, 15 February 2023 Hyperbolic Spline Interpolation (hist | edit) [2,566 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Hyperbolic Spline Interpolation (Hyperbolic Spline Interpolation)}} == Description == The problem of restoring complex curves and surfaces from discrete data so that their shape is preserved is called isogeometric interpolation. A very popular tool for solving this problem are hyperbolic splines in tension, which were introduced in 1966 by Schweikert. These splines have smoothness sufficient for many applications; combined with algorithms for the automat...")
- 10:24, 15 February 2023 DAG Realization Problem (hist | edit) [1,159 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:DAG Realization Problem (Graph Realization Problems)}} == Description == Given a sequence $S := (a_1, b_1), \ldots, (a_n, b_n)$ with $a_i, b_i \in \mathbb{Z}_0^+$, does there exist a directed acyclic graph (DAG) (no parallel arcs allowed) with labeled vertex set $V := \{v_1, \ldots , v_n\}$ such that for all $v_i \in V$ indegree and outdegree of $v_i$ match exactly the given numbers $a_i$ and $b_i$, respectively? == Related Problems == Generalizations...")
- 10:24, 15 February 2023 Digraph Realization Problem (hist | edit) [1,531 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Digraph Realization Problem (Graph Realization Problems)}} == Description == Given a sequence $S := (a_1, b_1), \ldots, (a_n, b_n)$ with $a_i, b_i \in \mathbb{Z}_0^+$, does there exist a directed graph (no parallel arcs allowed) with labeled vertex set $V := \{v_1, \ldots , v_n\}$ such that for all $v_i \in V$ indegree and outdegree of $v_i$ match exactly the given numbers $a_i$ and $b_i$, respectively? == Related Problems == Subproblem: DAG Realiza...")
- 10:24, 15 February 2023 Subtree Isomorphism (hist | edit) [1,788 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Subtree Isomorphism (Graph Isomorphism Problem)}} == Description == Determine whether a given tree is contained within another tree. == Related Problems == Generalizations: Largest Common Subtree Related: Graph Isomorphism, General Graphs, Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences == Parameters == <pre>n: number of vertices in the...")
- 10:24, 15 February 2023 Largest Common Subtree (hist | edit) [1,845 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Largest Common Subtree (Graph Isomorphism Problem)}} == Description == Find a largest tree which occurs as a common subgraph in a given collection of trees. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Subproblem: Subtree Isomorphism Related: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences == Parameters ==...")
- 10:24, 15 February 2023 Graph Isomorphism, Bounded Vertex Valences (hist | edit) [1,580 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, Bounded Vertex Valences (Graph Isomorphism Problem)}} == Description == Given two graphs with the degree of each vertex bounded, determine whether they are isomorphic to one another. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Related: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Largest Common Subtree, Subtree Isomorphism == Par...")
- 10:24, 15 February 2023 Graph Isomorphism, Trivalent Graphs (hist | edit) [1,323 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, Trivalent Graphs (Graph Isomorphism Problem)}} == Description == Given two trivalent graphs (AKA cubic graphs--graphs in which each vertex has degree 3), determine whether they are isomorphic to one another. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Related: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Bounded Vertex Valences, Largest Common Subtree,...")
- 10:24, 15 February 2023 Graph Isomorphism, Bounded Number of Vertices of Each Color (hist | edit) [1,706 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, Bounded Number of Vertices of Each Color (Graph Isomorphism Problem)}} == Description == Given two colored graphs with the number of vertices of each color bounded, determine whether they are isomorphic to one another. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Related: Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences, Largest Common Subtree, Subtree Is...")
- 10:24, 15 February 2023 Graph Isomorphism, General Graphs (hist | edit) [1,715 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, General Graphs (Graph Isomorphism Problem)}} == Description == Given two graphs, determine whether they are isomorphic to one another. == Related Problems == Subproblem: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences, Largest Common Subtree Related: Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Ve...")
- 10:24, 15 February 2023 Arithmetic Expression Binary Tree (hist | edit) [866 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Arithmetic Expression Binary Tree (AST to Code Translation)}} == Description == Translate a given arithmetic expression binary tree into machine-readable code that uses as few registers as possible. == Related Problems == Related: AST to Code Translation == Parameters == <pre>$n$: number of nodes in the tree</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space...")
- 10:23, 15 February 2023 AST to Code Translation (hist | edit) [498 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:AST to Code Translation (AST to Code Translation)}} == Description == Translate a given abstract syntax tree (AST) into machine-readable code that uses as few registers as possible. == Related Problems == Related: Arithmetic Expression Binary Tree == Parameters == <pre>$n$: number of nodes in the tree</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Time Complexity graph == File:AST to Co...")
- 10:23, 15 February 2023 Longest Palindromic Substring (hist | edit) [1,621 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Palindromic Substring (Longest Palindromic Substring)}} == Description == Given a string of length $n$, find the palindromic substrings of maximal length. == Parameters == <pre>n: length of given string</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Naive (Longest Palindromic Substring Longest Palin...")
- 10:23, 15 February 2023 Entity Resolution (hist | edit) [2,418 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Entity Resolution (Entity Resolution)}} == Description == Entity resolution (ER) is the problem of matching records that represent the same real-world entity and then merging the matching records. ER is a well known problem that arises in many applications. An exhaustive ER process involves comparing all the pairs of records, which can be very expensive for large datasets. == Parameters == No parameters found. == Table of Algorithms == {| class="wi...")
- 10:23, 15 February 2023 Ray Tracing (hist | edit) [1,257 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Ray Tracing (Ray Tracing)}} == Description == Ray tracing is an image rendering technique in which rays are cast from the viewpoint and followed as they reflect off of objects in the scene. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Dürer rendering algorithm ( Ray Tracin...")
- 10:23, 15 February 2023 Constructing Suffix Trees (hist | edit) [3,185 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Constructing Suffix Trees (Constructing Suffix Trees)}} == Description == Let $T = t_1 t_2 \cdots t_n, be a string over an alphabet $\Sigma$. Each string $x$ such that $T = uxv$ for some (possibly empty) strings $u$ and $v$ is a substring of $T$, and each string $T_i = t_i \cdots t_n$, where $1 \leq i \leq n + 1$ is a suffix of $T$; in particular, $T_{n+1} = \epsilon$ is the empty suffix. The set of all suffixes of $T$ is denoted $\sigma(T)$. The suffix...")
- 10:23, 15 February 2023 Maximum Square Subarray (hist | edit) [931 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Square Subarray (Maximum Subarray Problem)}} == Description == Given an $n \times n$ matrix find a maximum subarray with sides of equal length. == Related Problems == Generalizations: Maximum Subarray Related: 1D Maximum Subarray, 2D Maximum Subarray == Parameters == <pre>n: dimension of array</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Reductions FROM Problem == {| cl...")
- 10:23, 15 February 2023 2D Maximum Subarray (hist | edit) [1,454 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2D Maximum Subarray (Maximum Subarray Problem)}} == Description == Given an $n \times n$ matrix $A$ of integers, find $i, j, k,l \in (n)$ with $i \leq j, k \leq l$ maximizing $\sum^j_{x=i}\sum^l_{y=k}A(x,y)$, that is, find a contiguous subarray of $A$ of maximum sum == Related Problems == Generalizations: Maximum Subarray Related: 1D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: dimension of array</pre> == Table o...")
- 10:23, 15 February 2023 1D Maximum Subarray (hist | edit) [2,453 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:1D Maximum Subarray (Maximum Subarray Problem)}} == Description == Given an array $A$ of length $n$, find $i, j$ with $1\leq i \leq j \leq n$ maximizing $\sum^j_{x=i} A(x)$, that is, find a contiguous subarray of $A$ of maximum sum == Related Problems == Generalizations: Maximum Subarray Related: 2D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: length of array</pre> == Table of Algorithms == {| class="wikitable...")
- 10:23, 15 February 2023 Maximum Subarray (hist | edit) [3,820 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Subarray (Maximum Subarray Problem)}} == Description == Given a $d$-dimensional array $M$ with $n^d$ real-valued entries, find the $d$-dimensional subarray of $M$ which maximizes the sum of the elements it contains. == Related Problems == Subproblem: 1D Maximum Subarray, 2D Maximum Subarray, Maximum Square Subarray Related: 2D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: length of array d: dimens...")
- 10:23, 15 February 2023 Longest Path on Interval Graphs (hist | edit) [1,175 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Path on Interval Graphs (Longest Path Problem)}} == Description == The longest path problem is the problem of finding a path of maximum length in a graph. A graph $G$ is called interval graph if its vertices can be put in a one-to-one correspondence with a family $F$ of intervals on the real line such that two vertices are adjacent in $G$ if and only if the corresponding intervals intersect; $F$ is called an intersection model for $G$. == Param...")
- 10:23, 15 February 2023 Stable Pair Checking (hist | edit) [2,059 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Pair Checking (Stable Matching Problem)}} == Description == Verify that a given pairing is stable, given the preferences == Related Problems == Generalizations: Stable Marriage Problem Related: Almost Stable Marriage Problem, Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Matching Verification == Parameters == No parameters found. == Table of Algorithms == Currently no algorithms in our database...")
- 10:23, 15 February 2023 Stable Matching Verification (hist | edit) [1,096 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Matching Verification (Stable Matching Problem)}} == Description == Verify that a given matching is stable, given the preferences == Related Problems == Generalizations: Stable Marriage Problem Related: Almost Stable Marriage Problem, Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Pair Checking == Parameters == No parameters found. == Table of Algorithms == Currently no algorithms in our databas...")
- 10:23, 15 February 2023 Boolean d-Attribute Stable Matching (hist | edit) [1,582 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean d-Attribute Stable Matching (Stable Matching Problem)}} == Description == SMP in the d-attribute model. In the d-attribute model, we assume that there are d different attributes (e.g. income, height, sense of humor, etc.) with a fixed, possibly objective, ranking of the men for each attribute. Each woman’s preference list is based on a linear combination of the attributes of the men, where each woman can have different weights for each attribut...")
- 10:23, 15 February 2023 Stable Roommates Problem (hist | edit) [1,504 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Roommates Problem (Stable Matching Problem)}} == Description == Given $2n$ participants, each of participant ranks the others in strict order of preference. A matching is a set of $n$ disjoint pairs of participants. A matching $M$ in an instance of SRP is stable if there are no two participants $x$ and $y$, each of whom prefers the other to their partner in $M$. Such a pair is said to block $M$, or to be a blocking pair with respect to $M$. == Re...")
- 10:23, 15 February 2023 Almost Stable Marriage Problem (hist | edit) [971 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Almost Stable Marriage Problem (Stable Matching Problem)}} == Description == The task in the Almost Stable Marriage Problem is to find a matching that minimises the number of unstable edges, but the matching does not have to be a maximum matching. == Related Problems == Generalizations: Stable Marriage Problem Related: Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Matching Verification, Stable Pair Checking...")
- 10:23, 15 February 2023 Stable Marriage Problem (hist | edit) [3,036 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Marriage Problem (Stable Matching Problem)}} == Description == Given $n$ men and $n$ women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable. == Related Problems == Generalizations: ...")
- 10:23, 15 February 2023 Factorization of Polynomials Over Finite Fields (hist | edit) [864 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Factorization of Polynomials Over Finite Fields (Factorization of Polynomials Over Finite Fields)}} == Description == Factor a given polynomial over a finite field into a product of irreducible polynomials. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Schubert's algorithm (...")
- 10:23, 15 February 2023 Lossless Compression (hist | edit) [591 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Lossless Compression (Data Compression)}} == Description == The reduction or ideally elimination of redundancies in the original data to result in smaller required storage space is the goal of every compression scheme. There are two categories of data compression: lossy and lossless. Lossless compression is fully information-preserving and fully reversible. == Related Problems == Related: Lossy Compression == Parameters == No parameters found....")
- 10:23, 15 February 2023 Lossy Compression (hist | edit) [3,479 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Lossy Compression (Data Compression)}} == Description == The reduction or ideally elimination of redundancies in the original data to result in smaller required storage space is the goal of every compression scheme. There are two categories of data compression: lossy and lossless. Lossy compression is achieved by only discarding the redundancies and out of human perception information and getting rid of those extra bits. == Related Problems == Relat...")
- 10:23, 15 February 2023 Finding Frequent Itemsets (hist | edit) [1,631 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Finding Frequent Itemsets (Finding Frequent Itemsets)}} == Description == We assume there is a number $s$, called the support threshold. If $I$ is a set of items, the support for $I$ is the number of baskets for which $I$ is a subset. We say $I$ is frequent if its support is $s$ or more == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Sp...")
- 10:23, 15 February 2023 CFG Recognition (hist | edit) [1,934 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:CFG Recognition (CFG Problems)}} == Description == Given a grammar $G$ and a string $s$, determine if the string $s$ can be derived by the grammar $G$. == Related Problems == Related: CFG Parsing == Parameters == <pre>n: length of the given string</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Cocke...")
- 10:23, 15 February 2023 CFG Parsing (hist | edit) [2,174 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:CFG Parsing (CFG Problems)}} == Description == Given a grammar $G$ and a string $s$, find the parse structure, or analysis, assigned to the string $s$ by the grammar $G$. == Related Problems == Related: CFG Recognition == Parameters == <pre>n: length of the given string</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Re...")
- 10:23, 15 February 2023 The Vertex Cover Problem, Degrees Bounded By 3 (hist | edit) [1,254 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:The Vertex Cover Problem, Degrees Bounded By 3 (The Vertex Cover Problem)}} == Description == A vertex cover of a graph $G$ is a set $C$ of vertices such that every edge of $G$ has at least one endpoint in $C$. The vertex cover problem is to find a minimum-size vertex cover in a given graph $G$. This version of the problem is such that the input graph $G$ has all vertices' degree bounded by 3. == Related Problems == Generalizations: The Vertex Cover...")
- 10:23, 15 February 2023 The Vertex Cover Problem (hist | edit) [5,138 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:The Vertex Cover Problem (The Vertex Cover Problem)}} == Description == A vertex cover of a graph $G$ is a set $C$ of vertices such that every edge of $G$ has at least one endpoint in $C$. The vertex cover problem is to find a minimum-size vertex cover in a given graph $G$. == Related Problems == Subproblem: The Vertex Cover Problem, Degrees Bounded By 3 == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sort...")
- 10:23, 15 February 2023 4NF Decomposition for Conflict-Free Dependency Sets (hist | edit) [2,820 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:4NF Decomposition for Conflict-Free Dependency Sets (4NF Decomposition)}} == Description == 4NF Decomposition is the problem of decomposing a relation schema into fourth normal form (4NF). This variation specifies that the input dependency set is conflict-free. A relation schema $R^*$ is in fourth normal form (4NF) if, whenever a nontrivial multivalued dependency $X \rightarrow \rightarrow Y$ holds for $R^*$, then so does the functiunal dependency $X \r...")
- 10:23, 15 February 2023 4NF Decomposition for Functional and Multivalued Dependency Sets (hist | edit) [3,069 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:4NF Decomposition for Functional and Multivalued Dependency Sets (4NF Decomposition)}} == Description == 4NF Decomposition is the problem of decomposing a relation schema into fourth normal form (4NF). This variation specifies that the input dependency set has only functional and multivalued dependencies. A relation schema $R^*$ is in fourth normal form (4NF) if, whenever a nontrivial multivalued dependency $X \rightarrow \rightarrow Y$ holds for $R^*$,...")
- 10:23, 15 February 2023 4NF Decomposition (hist | edit) [3,239 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:4NF Decomposition (4NF Decomposition)}} == Description == 4NF Decomposition is the problem of decomposing a relation schema into fourth normal form (4NF). A relation schema $R^*$ is in fourth normal form (4NF) if, whenever a nontrivial multivalued dependency $X \rightarrow \rightarrow Y$ holds for $R^*$, then so does the functiunal dependency $X \rightarrow A$ for every column name $A$ of $R^*$. Intuitively all dependencies are the result of keys. In pa...")
- 10:23, 15 February 2023 Decisional BCNF (hist | edit) [1,227 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Decisional BCNF (BCNF Decomposition)}} == Description == Decisional BCNF is the problem of deciding whether or not a relation schema can be turned into Boyce-Codd normal form (BCNF). A relation schema $R$ is in Boyce Codd Normal Form (abbr. BCNF) if for all non-trivial FDs $X \rightarrow Y$ in $F^+$, $X$ is a superkey. In extending this notion to database schemas, we must be conscious of the UR-assumption. We say that $R_i = <ATTR_i,F_i>$ is in BCNF if...")
- 10:22, 15 February 2023 Multivalued Dependency Inference Problem (hist | edit) [2,220 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Multivalued Dependency Inference Problem (Dependency Inference Problem)}} == Description == The multivalued dependency inference problem is to find a cover for the set of multivalued dependencies that hold in a given relation. A multivalued dependency (abbr. MVD), $g$, on a set of attributes $U$ is a statement $g: X \rightarrow \rightarrow Y$, where $X$ and $Y$ are subsets of $U$. Let $Z$ be the complement of the union of $X$ and $Y$ in $U$. A relation...")
- 10:22, 15 February 2023 Functional Dependency Inference Problem (hist | edit) [2,051 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Functional Dependency Inference Problem (Dependency Inference Problem)}} == Description == The functional dependency inference problem is to find a cover for the set of functional dependencies that hold in a given relation. A functional dependency (abbr. FD), $f$, is a statement $f: X \rightarrow Y$ where $X$ and $Y$ are sets of attributes. If $R(X, Y, \ldots)$ is a relation on a set of attributes that contains $X$ and $Y$, then $R$ obeys the FD $f$ if...")
- 10:22, 15 February 2023 Subset Sum (hist | edit) [4,859 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Subset Sum (The Subset-Sum Problem)}} == Description == Given a set $S$ of integers and a target sum $t$, determine whether there is a subset of $S$ that sum to $t$. == Parameters == <pre>S: the set of integers n: the number of integers in the set n': the number of distinct elements in the set t: the target sum σ: sum of elements in the set</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Na...")
- 10:22, 15 February 2023 De Novo Genome Assembly (hist | edit) [2,036 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:De Novo Genome Assembly (De Novo Genome Assembly)}} == Description == De novo sequencing refers to sequencing a novel genome where there is no reference sequence available for alignment. Sequence reads are assembled as contigs, and the coverage quality of de novo sequence data depends on the size and continuity of the contigs (ie, the number of gaps in the data). == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable so...")
- 10:22, 15 February 2023 Delaunay Triangulation (hist | edit) [3,906 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Delaunay Triangulation (Delaunay Triangulation)}} == Description == Given a set of points, the Delaunay Triangulation problem is to triangulate the points using the following notion of triangulation. $AB$ is an edge of the Delaunay triangulation iff there is a circle passing through $A$ and $B$ so that all other points in the point set, $C$, where $C$ is not equal to $A$ or $B$, lie outside the circle. Equivalently, all triangles in the Delaunay triangu...")
- 10:22, 15 February 2023 3-Dimensional Poisson Problem (hist | edit) [2,865 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:3-Dimensional Poisson Problem (Poisson Problem)}} == Description == Given $f$, solve for $u$ in the 3-dimensional Poisson equation: $u_{xx} + u_{yy} + u_{zz} = f(x,y,z)$ == Related Problems == Related: 2-Dimensional Poisson Problem == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Referenc...")
- 10:22, 15 February 2023 2-Dimensional Poisson Problem (hist | edit) [2,854 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2-Dimensional Poisson Problem (Poisson Problem)}} == Description == Given $f$, solve for $u$ in the 2-dimensional Poisson equation: $u_{xx} + u_{yy} = f(x,y)$ == Related Problems == Related: 3-Dimensional Poisson Problem == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | ...")
- 10:22, 15 February 2023 Approximate TSP (hist | edit) [2,382 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Approximate TSP (The Traveling-Salesman Problem)}} == Description == Approximate TSP is the problem of finding an approximate answer to Minimum TSP. In Minimum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that minimizes the length of the tour. This is the typical variation of TSP....")
- 10:22, 15 February 2023 Maximum TSP (hist | edit) [1,562 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum TSP (The Traveling-Salesman Problem)}} == Description == In Maximum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that maximizes the length of the tour. == Related Problems == Related: Minimum TSP, Approximate TSP == Parameters == <pre>V: number of cities (nodes...")
- 10:22, 15 February 2023 Minimum TSP (hist | edit) [2,636 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Minimum TSP (The Traveling-Salesman Problem)}} == Description == In Minimum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that minimizes the length of the tour. This is the typical variation of TSP. == Related Problems == Related: Maximum TSP, Approximate TSP == Parameter...")