User contributions for Admin

15 February 2023

• 11:1411:14, 15 February 2023 diff hist +35‎ N Family:NFA to DFA conversion ‎ Redirected page to NFA to DFA conversion current Tag: New redirect
• 11:1411:14, 15 February 2023 diff hist +225‎ N Family:Line Clipping ‎ 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" current
• 11:1411:14, 15 February 2023 diff hist +19‎ N Family:Joins ‎ Redirected page to Joins current Tag: New redirect
• 11:1411:14, 15 February 2023 diff hist +232‎ N Family:Sequence Alignment ‎ 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" current
• 11:1411:14, 15 February 2023 diff hist +195‎ N Family:String Search ‎ 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" current
• 11:1311:13, 15 February 2023 diff hist +29‎ N Family:Informed Search ‎ Redirected page to Informed Search current Tag: New redirect
• 11:1311:13, 15 February 2023 diff hist +221‎ N Family:LU Decomposition ‎ 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" current
• 11:1311:13, 15 February 2023 diff hist +189‎ N Family:Integer Factoring ‎ Created page with "{{DISPLAYTITLE:Integer Factoring}}== Description == Currently no description in our database for the given family. == Problems Variations == * Integer Factoring * Smallest Factor" current
• 11:1311:13, 15 February 2023 diff hist +827‎ N Family:All-Pairs Shortest Paths (APSP) ‎ 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..." current
• 11:1311:13, 15 February 2023 diff hist +532‎ N Family:Shortest Path (Directed Graphs) ‎ 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..." current
• 11:1311:13, 15 February 2023 diff hist +339‎ N Family:Closest Pair Problem ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +380‎ N Family:Minimum Spanning Tree (MST) ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +356‎ N Family:Strongly Connected Components ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +314‎ N Family:Convex Hull ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +443‎ N Family:Line segment intersection ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +275‎ N Family:Linear Programming ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +320‎ N Family:Linear System ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +342‎ N Family:Matrix Product ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +339‎ N Family:Maximum Flow ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +233‎ N Family:Longest Common Subsequence ‎ 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" current
• 11:1211:12, 15 February 2023 diff hist +273‎ N Family:Matrix Chain Multiplication ‎ 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" current
• 11:1111:11, 15 February 2023 diff hist +33‎ N Family:kth Order Statistic ‎ Redirected page to Kth Order Statistic current Tag: New redirect
• 11:1111:11, 15 February 2023 diff hist +201‎ N Family:Sorting ‎ Created page with "{{DISPLAYTITLE:Sorting}}== Description == Currently no description in our database for the given family. == Problems Variations == * Comparison Sorting * Non-Comparison Sorting * Sorting" current
• 11:1111:11, 15 February 2023 diff hist +3,125‎ N Domain:Cryptography ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +1,551‎ N Domain:Statistics ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +40‎ N Domain:Signal Processing ‎ Redirected page to Discrete Fourier Transform current Tag: New redirect
• 11:1111:11, 15 February 2023 diff hist +2,546‎ N Domain:Robotics ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +2,583‎ N Domain:Operating Systems ‎ 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:1111:11, 15 February 2023 diff hist +3,049‎ N Domain:Numerical Analysis ‎ 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:1111:11, 15 February 2023 diff hist +2,251‎ N Domain:Image Processing ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +1,423‎ N Domain:Databases ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +5,281‎ N Domain:Combinatorics ‎ 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:1111:11, 15 February 2023 diff hist +1,524‎ N Domain:Bioinformatics ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +437‎ N List:Domains ‎ Created page with "* Bioinformatics * Combinatorics * Databases * Image Processing * Numerical Analysis * Operating Systems * Robotics * Signal Processing * Statistics * Cryptography" current
• 11:1111:11, 15 February 2023 diff hist +1,697‎ N List:Hypotheses ‎ 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..." current
• 11:1111:11, 15 February 2023 diff hist +10,798‎ N List:Problem Families ‎ 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..." current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Nash Equilibria - Space.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Multiplication - Pareto Frontier.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Maximum Flow - Time.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Poisson Problem - Pareto Frontier.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:4NF Decomposition - Time.png ‎No edit summary
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Minimum Spanning Tree (MST) - Undirected, General MST - Pareto Frontier.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:CFG Problems - CFG Recognition - Pareto Frontier.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:The Traveling-Salesman Problem - Time.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Turnpike Problem - Time.png ‎No edit summary
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Coset Enumeration - Time.png ‎No edit summary
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:4NF Decomposition - 4NF Decomposition for Functional and Multivalued Dependency Sets - Pareto Frontier.png ‎No edit summary
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Pareto Frontier.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Determinant of Matrices with Integer Entries - Pareto Frontier.png ‎No edit summary current
• 11:0511:05, 15 February 2023 diff hist 0‎ N File:Data Compression - Lossy Compression - Pareto Frontier.png ‎No edit summary current