New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10:14, 15 February 2023 Family:Root Computation (hist | edit) [229 bytes] Admin (talk | contribs) (Redirected page to Root Computation) Tag: New redirect
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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...")
- 10: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...")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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")
- 10: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...")
- 10: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...")
- 10: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...")
- 10: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...")