Search results

| title = The complexity of membership problems for circuits over sets of integers | [[NEXPTIME]]-complete ...

...t complexity|non-uniform]] analogue of the class [[NP (complexity)|NP]] of problems solvable in [[polynomial time]] by a [[non-deterministic Turing machine]]. NP/poly is defined as the class of problems solvable in polynomial time by a non-deterministic Turing machine that has ...

...r=519066|title-link=Computers and Intractability: A Guide to the Theory of NP-Completeness}}</ref> Some computational problems are parameterized by numbers whose magnitude exponentially exceed size of t ...

'''Numerical 3-dimensional matching''' is an [[NP-complete]] decision problem. It is given by three [[multisets]] of [[integer]]s <mat ...S. Johnson (1979), Computers and Intractability; A Guide to the Theory of NP-Completeness. {{ISBN|0-7167-1045-5}}</ref> ...

{{Short description|Difficulty measures for computer science problems}} ...n be described as the class of [[boolean circuit]]s over [[NP (complexity)|NP]] predicates. A collapse of the boolean hierarchy would imply a collapse of ...

{{Short description|Classic NP-complete problem in computer science}} ...larkson.edu/~alexis/PCMI/Notes/lectureB07.pdf|title=Lecture 7: NP-Complete Problems|date=July 5, 2000|author=David Mix Barrington and Alexis Maciel}}</ref> In ...

...he Theory of NP-Completeness|Garey & Johnson's]] classical [[NP-complete]] problems.<ref name="GareyJohnson"/> The problem is sometimes called [[Property B|hyp ...tion which maximizes the number of split elements of ''F''. It is an [[APX-complete]]<ref name="Petrank94"/> problem and hence in [[Optimization_problem#NP_opt ...

...ion enables disjunctive Datalog to express several [[NP-hardness|NP-hard]] problems that are not known to be expressable in plain Datalog. Disjunctive Datalog {{expand section|date=March 2023|with=examples of programs expressing these problems}} ...

...variant of the [[Boolean satisfiability problem]], often used in proofs of NP-completeness.{{r|moqo}} [[File:Monotone NAE3SAT.svg|thumb|180px|'''Monotone''' NAE3SAT problems can be represented by [[vertex coloring]] a [[hypergraph]] so that every ed ...

=== Algorithmic problems === For circuits which use all the labels, all these problems are equivalent. ...

{{short description|On the complexity classes of problems about satisfying a subset of boolean relations}} ...liamson|date=Mar 2000|title=The Approximability of Constraint Satisfaction Problems|journal=SIAM J. Comput.|publisher=SIAM|volume=30 | number=6 |pages=1863–192 ...

...iding whether a given clause θ-subsumes another is an [[NP-completeness|NP-complete]] problem. ...more precisely, the problem of whether one clause θ-subsumes another is NP-complete in the length of the clauses. This is still true when restricting the setti ...

...[[complexity class]]es, rather than computational complexity of individual problems and algorithms. It involves the research of both internal structures of var ...t of the research is done basing on the assumption of P not being equal to NP and on a more far-reaching conjecture that the [[polynomial time hierarchy] ...

==Related problems== ...''dag realization''. {{harvtxt|Nichterlein|Hartung|2012}} proved the [[NP-complete]]ness of this problem. {{harvtxt|Berger|Müller-Hannemann|2011}} showed that ...

...bipartite is hereditary). All such problems for nontrivial properties are NP-hard.{{r|gt21|yan}} ...meterized algorithms.{{r|pa}} The parameterized algorithms known for these problems take nearly-linear time for any fixed value of <math>k</math>.{{r|kr}} Alte ...

...gative cycles, detecting a simple cycle of weight ''exactly'' 0 is an [[NP-complete]] problem.{{r|ss}} This is true even when the weights are integers of polyn [[Category:NP-complete problems]] ...

...le values, but determining the exact value among these two choices is [[NP-complete]]. ==Related problems== ...

.... However, in higher dimensions, they are known to be [[NP-completeness|NP-complete]] even for simple shapes, i.e., when <math>\mathcal{R}</math> is induced by | title = Optimal packing and covering in the plane are NP-complete ...

...moves, which is at most linear size, so it remains to show the problem is NP-hard as well. This is done via [[reduction (complexity)|reduction]] from [ ...complete, to token reconfiguration. Thus token reconfiguration is also NP-complete on general graphs. ...

The maximum common edge subgraph problem on general graphs is [[NP-complete]] as it is a generalization of [[subgraph isomorphism]]: a graph <math>H</m [[Category:Computational problems in graph theory]] ...