19 relations: Circuit satisfiability problem, Clique (graph theory), Computational complexity theory, Computational problem, Computer science, Dominating set, Function (mathematics), Graph coloring, Independent set (graph theory), Kernelization, NP-completeness, NP-hardness, P versus NP problem, Parameterized complexity, Polynomial-time approximation scheme, Reduction (complexity), Satisfiability, Time complexity, Vertex cover.

## Circuit satisfiability problem

In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining whether a given Boolean circuit has an assignment of its inputs that makes the output true.

New!!: Parameterized complexity and Circuit satisfiability problem ·

## Clique (graph theory)

In the mathematical area of graph theory, a clique is subset of vertices of an undirected graph, such that its induced subgraph is complete; that is, every two distinct vertices in the clique are adjacent.

New!!: Parameterized complexity and Clique (graph theory) ·

## Computational complexity theory

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

New!!: Parameterized complexity and Computational complexity theory ·

## Computational problem

In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve.

New!!: Parameterized complexity and Computational problem ·

## Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations Computer science is the scientific and practical approach to computation and its applications.

New!!: Parameterized complexity and Computer science ·

## Dominating set

In graph theory, a dominating set for a graph G.

New!!: Parameterized complexity and Dominating set ·

## Function (mathematics)

In mathematics, a function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output.

New!!: Parameterized complexity and Function (mathematics) ·

## Graph coloring

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.

New!!: Parameterized complexity and Graph coloring ·

## Independent set (graph theory)

In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.

New!!: Parameterized complexity and Independent set (graph theory) ·

## Kernelization

In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which inputs to the algorithm are replaced by a smaller input, called a "kernel".

New!!: Parameterized complexity and Kernelization ·

## NP-completeness

In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard.

New!!: Parameterized complexity and NP-completeness ·

## NP-hardness

NP-hardness (''n''on-deterministic ''p''olynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP".

New!!: Parameterized complexity and NP-hardness ·

## P versus NP problem

The P versus NP problem is a major unsolved problem in computer science.

New!!: Parameterized complexity and P versus NP problem ·

## Parameterized complexity

In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input.

New!!: Parameterized complexity and Parameterized complexity ·

## Polynomial-time approximation scheme

In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP-hard optimization problems).

New!!: Parameterized complexity and Polynomial-time approximation scheme ·

## Reduction (complexity)

In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem.

New!!: Parameterized complexity and Reduction (complexity) ·

## Satisfiability

In mathematical logic, satisfiability and validity are elementary concepts of semantics.

New!!: Parameterized complexity and Satisfiability ·

## Time complexity

In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input.

New!!: Parameterized complexity and Time complexity ·

## Vertex cover

In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.

New!!: Parameterized complexity and Vertex cover ·

## Redirects here:

FPT (complexity class), Fixed-parameter algorithm, Fixed-parameter tractability, Fixed-parameter tractable, Parameterised complexity, Parameterized (Multivariate) Complexity, Parameterized Complexity, Parametrised complexity, Parametrized complexity, W (complexity class), W Hierarchy, W hierarchy, W(1), W(2), W-Hierarchy, W-hierarchy, XP (class), XP (complexity class).