New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:19, 15 February 2023 Transitive Closure (hist | edit) [1,060 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Transitive Closure (Strongly Connected Components)}} == Description == In this problem, we also want to compute the transitive closure of a graph. (Perhaps this should be a separate problem?) == Related Problems == Related: Strongly Connected Components, Maximum Strongly Connected Component, Strong Connectivity (dynamic), 2 Strong Components (dynamic), Connected Subgraph == Parameters == <pre>V: number of vertices E: number of e...")
- 10:19, 15 February 2023 2-dimensional Convex Hull, Dynamic (hist | edit) [1,411 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2-dimensional Convex Hull, Dynamic (Convex Hull)}} == Description == Here, the input points may be sequentially inserted or deleted, and the convex hull must be updated after each insert/delete operation. == Related Problems == Generalizations: 2-dimensional Convex Hull Related: 3-dimensional Convex Hull, d-dimensional Convex Hull, 2-dimensional Convex Hull, Online == Parameters == <pre>n: number of line segments h: number of point...")
- 10:19, 15 February 2023 2-dimensional Convex Hull, Online (hist | edit) [1,340 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2-dimensional Convex Hull, Online (Convex Hull)}} == Description == Here, we are given the input points one by one, and must maintain the current convex hull after each input point. == Related Problems == Generalizations: 2-dimensional Convex Hull Related: 3-dimensional Convex Hull, d-dimensional Convex Hull, 2-dimensional Convex Hull, Dynamic == Parameters == <pre>n: number of line segments h: number of points on the convex hull</...")
- 10:19, 15 February 2023 D-dimensional Convex Hull (hist | edit) [1,690 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:d-dimensional Convex Hull (Convex Hull)}} == Description == Here, we are looking at the general d-dimensional case. == Related Problems == Subproblem: 2-dimensional Convex Hull, 3-dimensional Convex Hull Related: 3-dimensional Convex Hull, 2-dimensional Convex Hull, Online, 2-dimensional Convex Hull, Dynamic == Parameters == <pre>n: number of line segments h: number of points on the convex hull f_1: number of facets on the con...")
- 10:19, 15 February 2023 3-dimensional Convex Hull (hist | edit) [932 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:3-dimensional Convex Hull (Convex Hull)}} == Description == Here, we are looking at the 3-dimensional case. == Related Problems == Generalizations: d-dimensional Convex Hull Related: 2-dimensional Convex Hull, 2-dimensional Convex Hull, Online, 2-dimensional Convex Hull, Dynamic == Parameters == <pre>n: number of line segments h: number of points on the convex hull</pre> == Table of Algorithms == {| class="wikitable sortable" s...")
- 10:19, 15 February 2023 2-dimensional Convex Hull (hist | edit) [1,996 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2-dimensional Convex Hull (Convex Hull)}} == Description == The convex hull or convex envelope or convex closure of a set X of points in the Euclidean plane or in a Euclidean space (or; more generally; in an affine space over the reals) is the smallest convex set that contains X. Here, we are looking at the 2-dimensional case. == Related Problems == Generalizations: d-dimensional Convex Hull Subproblem: 2-dimensional Convex Hull, Online, 2...")
- 10:19, 15 February 2023 Counting number of intersection points, line segments (hist | edit) [792 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Counting number of intersection points, line segments (Line segment intersection)}} == Description == In this case, we are supplied with a list of line segments, and we wish to count the number of points of intersection. == Related Problems == Generalizations: Reporting all intersection points, line segments Related: Reporting all intersection points, generalized segments, Reporting all intersection points, convex polygons, Reporting al...")
- 10:18, 15 February 2023 Reporting all intersection points, general polygons (hist | edit) [811 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Reporting all intersection points, general polygons (Line segment intersection)}} == Description == In this case, we are supplied with a list of polygons (not necessarily convex), and we wish to report all regions of intersection. == Related Problems == Subproblem: Reporting all intersection points, convex polygons Related: Reporting all intersection points, line segments, Reporting all intersection points, generalized segments, Countin...")
- 10:18, 15 February 2023 Reporting all intersection points, convex polygons (hist | edit) [1,428 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Reporting all intersection points, convex polygons (Line segment intersection)}} == Description == In this case, we are supplied with a list of convex polygons, and we wish to report all regions of intersection. == Related Problems == Generalizations: Reporting all intersection points, general polygons Related: Reporting all intersection points, line segments, Reporting all intersection points, generalized segments, Counting number of i...")
- 10:18, 15 February 2023 Reporting all intersection points, generalized segments (hist | edit) [1,961 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Reporting all intersection points, generalized segments (Line segment intersection)}} == Description == In this case, the segments are generalized (i.e. have algebraic degree ≥1); we still wish to report all points of intersection. == Related Problems == Subproblem: Reporting all intersection points, line segments Related: Reporting all intersection points, convex polygons, Reporting all intersection points, general polygons, Counting...")
- 10:18, 15 February 2023 Reporting all intersection points, line segments (hist | edit) [2,457 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Reporting all intersection points, line segments (Line segment intersection)}} == Description == The line segment intersection problem supplies a list of line segments in the Euclidean plane and asks about the points where they intersect (cross), if any. In this case, we wish to report all points of intersection. == Related Problems == Generalizations: Reporting all intersection points, generalized segments Subproblem: Counting number of inters...")
- 10:18, 15 February 2023 0-1 Linear Programming (hist | edit) [3,138 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:0-1 Linear Programming (Linear Programming)}} == Description == In this case, we require all of the variables to be either 0 or 1. == Related Problems == Generalizations: Integer Linear Programming Related: General Linear Programming, Linear Programming with Reals == Parameters == <pre>n: number of variables m: number of constraints L: length of input, in bits</pre> == Table of Algorithms == {| class="wikitable sortable" style="tex...")
- 10:18, 15 February 2023 Integer Linear Programming (hist | edit) [3,145 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integer Linear Programming (Linear Programming)}} == Description == In this case, we require all of the variables to be integers. == Related Problems == Generalizations: Linear Programming with Reals Subproblem: 0-1 Linear Programming Related: General Linear Programming == Parameters == <pre>n: number of variables m: number of constraints L: length of input, in bits</pre> == Table of Algorithms == {| class="wikitable sortable" sty...")
- 10:18, 15 February 2023 Linear Programming with Reals (hist | edit) [3,212 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Linear Programming with Reals (Linear Programming)}} == Description == In this case, we allow all of the variables to be any real number. == Related Problems == Generalizations: General Linear Programming Subproblem: Integer Linear Programming Related: 0-1 Linear Programming == Parameters == <pre>n: number of variables m: number of constraints L: length of input, in bits</pre> == Table of Algorithms == {| class="wikitable sortable"...")
- 10:18, 15 February 2023 General Linear Programming (hist | edit) [3,395 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:General Linear Programming (Linear Programming)}} == Description == Linear programming (LP; also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). == Related Problems == Subproblem: Linear Programming wi...")
- 10:18, 15 February 2023 Vandermonde Matrix (hist | edit) [1,246 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Vandermonde Matrix (Linear System)}} == Description == In this case, we restrict $A$ to be a Vandermonde matrix. == Related Problems == Generalizations: General Linear System Related: Sparse Linear System, Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Toeplitz Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k: ratio between largest and sma...")
- 10:18, 15 February 2023 Toeplitz Matrix (hist | edit) [1,569 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Toeplitz Matrix (Linear System)}} == Description == In this case, we restrict $A$ to be a Toeplitz matrix. == Related Problems == Generalizations: General Linear System Related: Sparse Linear System, Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Vandermonde Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k: ratio between largest and smalle...")
- 10:18, 15 February 2023 Non-Definite, Symmetric Matrix (hist | edit) [1,286 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Non-Definite, Symmetric Matrix (Linear System)}} == Description == In this case, we restrict $A$ to be non-definite and symmetric. == Related Problems == Generalizations: General Linear System Related: Sparse Linear System, Positive Definite, Hermitian Matrix, Toeplitz Matrix, Vandermonde Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k: ratio between largest a...")
- 10:18, 15 February 2023 Positive Definite, Hermitian Matrix (hist | edit) [1,494 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Positive Definite, Hermitian Matrix (Linear System)}} == Description == In this case, we restrict $A$ to be positive definite and hermitian (or symmetric, if $A$ is real-valued). == Related Problems == Generalizations: General Linear System Related: Sparse Linear System, Non-Definite, Symmetric Matrix, Toeplitz Matrix, Vandermonde Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero e...")
- 10:18, 15 February 2023 Sparse Linear System (hist | edit) [1,042 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Sparse Linear System (Linear System)}} == Description == In this case, we restrict $A$ to be sparse (i.e. $A$ only has $O(n)$ nonzero entries). == Related Problems == Generalizations: General Linear System Related: Positive Definite, Hermitian Matrix, Non-Definite, Symmetric Matrix, Toeplitz Matrix, Vandermonde Matrix == Parameters == <pre>n: number of variables and number of equations m: number of nonzero entries in matrix k:...")
- 10:18, 15 February 2023 General Linear System (hist | edit) [1,592 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:General Linear System (Linear System)}} == Description == A system of linear equations (or linear system) is a collection of one or more linear equations involving the same set of variables. This is typically written in the form $Ax=b$ where $A$ is a matrix and $x, b$ are vectors. In this case, we impose no restrictions on $A$. == Related Problems == Subproblem: Sparse Linear System, Positive Definite, Hermitian Matrix, Non-Definite, Symme...")
- 10:18, 15 February 2023 $(\min, \leq)$ Product (hist | edit) [954 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:$(\min, \leq)$ Product (Matrix Product)}} == Description == Matrix product over the $(\min, \leq)$-semiring == Related Problems == Related: Matrix Multiplication, Boolean Matrix Multiplication, Boolean Matrix Multiplication (Combinatorial), Matrix Product Verification, Distance Product == Parameters == <pre>n: dimension of square matrix</pre> == Table of Algorithms == Currently no algorithms in our database for the given prob...")
- 10:18, 15 February 2023 Distance Product (hist | edit) [1,495 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Distance Product (Matrix Product)}} == Description == Matrix product over the $(\min, +)$-semiring == Related Problems == Related: Matrix Multiplication, Boolean Matrix Multiplication, Boolean Matrix Multiplication (Combinatorial), Matrix Product Verification, $(\min, \leq)$ Product == Parameters == <pre>n: dimension of square matrix</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem...")
- 10:18, 15 February 2023 Matrix Product Verification (hist | edit) [990 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Product Verification (Matrix Product)}} == Description == Given three matrices $A, B, C$, verify that $AB = C$, i.e. that $C$ is the matrix product of $A$ and $B$ == Related Problems == Generalizations: Matrix Multiplication Related: Boolean Matrix Multiplication, Boolean Matrix Multiplication (Combinatorial), Distance Product, $(\min, \leq)$ Product == Parameters == <pre>n: dimension of square matrix</pre> == Table of...")
- 10:18, 15 February 2023 Boolean Matrix Multiplication (Combinatorial) (hist | edit) [2,533 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Matrix Multiplication (Combinatorial) (Matrix Product)}} == Description == Matrix multiplication of two boolean matrices (i.e. where all entries are in $F_2$ and addition is mod 2). Here, only "combinatorial" algorithms are considered. == Related Problems == Generalizations: Boolean Matrix Multiplication Related: Matrix Multiplication, Matrix Product Verification, Distance Product, $(\min, \leq)$ Product == Parameters ==...")
- 10:18, 15 February 2023 Boolean Matrix Multiplication (hist | edit) [7,916 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Matrix Multiplication (Matrix Product)}} == Description == Matrix multiplication of two boolean matrices (i.e. where all entries are in $F_2$ and addition is mod 2) == Related Problems == Generalizations: Matrix Multiplication Subproblem: Boolean Matrix Multiplication (Combinatorial) Related: Matrix Product Verification, Distance Product, $(\min, \leq)$ Product == Parameters == <pre>n: dimension of square matrix</pre>...")
- 10:18, 15 February 2023 Maximum Local Edge Connectivity (hist | edit) [6,062 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Local Edge Connectivity (Maximum Flow)}} == Description == Find the pair of nodes with the maximum number of edge-disjoint paths between them == Related Problems == Related: st-Maximum Flow, Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow == Parameters == <pre>V: number of vertices E: number of edges</pre> == Table of Algorithms == {| class="wikita...")
- 10:18, 15 February 2023 All-Pairs Maximum Flow (hist | edit) [6,440 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:All-Pairs Maximum Flow (Maximum Flow)}} == Description == Find the maximum flow between all pairs of nodes == Related Problems == Related: st-Maximum Flow, Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of vertices E: number of edges</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:c...")
- 10:18, 15 February 2023 Minimum-Cost Flow (hist | edit) [5,740 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Minimum-Cost Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, each edge is given a cost coefficient, and we wish to minimize total cost while reaching a threshold flow. == Related Problems == Related: st-Maximum Flow, Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, All-Pairs Maximum Flow, Maximum Local Ed...")
- 10:18, 15 February 2023 Non-integer Maximum Flow (hist | edit) [5,591 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Non-integer Maximum Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, the capacities may be non-integers. == Related Problems == Subproblem: Integer Maximum Flow Related: st-Maximum Flow, Unweighted Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of ver...")
- 10:18, 15 February 2023 Unweighted Maximum Flow (hist | edit) [5,622 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Unweighted Maximum Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, all edges have unit weight. == Related Problems == Generalizations: Integer Maximum Flow Related: st-Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of vertic...")
- 10:18, 15 February 2023 Integer Maximum Flow (hist | edit) [6,683 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Integer Maximum Flow (Maximum Flow)}} == Description == Maximum flow problems involve finding a feasible flow through a flow network that is maximum. In this variant, the capacities must be integers. == Related Problems == Generalizations: Non-Integer Maximum Flow Subproblem: Unweighted Maximum Flow Related: st-Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity...")
- 10:18, 15 February 2023 St-Maximum Flow (hist | edit) [7,829 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:st-Maximum Flow (Maximum Flow)}} == Description == Find the maximum flow from $s$ to $t$ == Related Problems == Related: Integer Maximum Flow, Unweighted Maximum Flow, Non-integer Maximum Flow, Minimum-Cost Flow, All-Pairs Maximum Flow, Maximum Local Edge Connectivity == Parameters == <pre>V: number of vertices E: number of edges U: maximum edge capacity</pre> == Table of Algorithms == {| class="wikitable sortable" style...")
- 10:18, 15 February 2023 Longest Common Substring with don't cares (hist | edit) [1,356 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Common Substring with don't cares (Longest Common Subsequence)}} == Description == Find the length of the longest common substring of two strings S and T, where S is a binary string and T is is a binary string and additional * characters that can match either 0 or 1. == Related Problems == Generalizations: Longest Common Subsequence == Parameters == <pre>$n$: length of the longer input string $m$: length of the shorter input string $r$:...")
- 10:18, 15 February 2023 Longest Common Subsequence (hist | edit) [1,377 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Common Subsequence (Longest Common Subsequence)}} == Description == The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). == Related Problems == Subproblem: Longest Common Substring with don't cares == Parameters == <pre>$n$: length of the longer input string $m$: length of the shorter input string $r$: length of the LCS $s...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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 ==...")
- 10: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")
- 10: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")
- 10: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...")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
