Search results

...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 ...

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

'''Numerical 3-dimensional matching''' is an [[NP-complete]] decision problem. It is given by three [[multisets]] of [[intege ...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 ...

...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}} ...

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

The problem is known to be [[NP-hardness|NP-hard]] and even hard to approximate. ...ed it "minimum weight solution to linear equations". They proved it was NP-hard, but did not consider approximations. ...

{{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 ...

...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 ...

{{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 ...

{{Short description|Set of related problems in graph theory}} ...the number of pebbles that can occupy a vertex at any time. Pebble motion problems occur in domains such as multi-[[robot]] [[motion planning]] (in which the ...

...[[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] ...

...>{{Cite journal|last=Toda|first=Seinosuke|date=October 1991|title=PP is as Hard as the Polynomial-Time Hierarchy|url=http://epubs.siam.org/doi/10.1137/0220 ...rect more than half the time. The class P^#P consists of all the problems that can be solved in polynomial time if you have access to instantaneous a ...

...partite 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 ...

...math> has the same number of edges as <math>H</math>. The problem is [[APX-hard]], unless the two input graphs <math>G</math> and <math>G'</math> are requi [[Category:Computational problems in graph theory]] ...

...ath> into instances of another problem <math>Y</math> that is to be proven hard. It consists of two functions <math>f</math> and <math>g</math>, both of wh ...tion]] is a polynomial-time transformation <math>f</math> on the inputs to problems that preserves the exact values of the outputs. Such a reduction can be vie ...

...ves, 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 [[set ...NP-complete, to token reconfiguration. Thus token reconfiguration is also NP-complete on general graphs. ...

...author5=Vladimir Gurvich |title=Generating All Vertices of a Polyhedron Is Hard |journal=[[Discrete and Computational Geometry]] |volume=39 |number=1–3 |da [[Category:Mathematical problems]] ...

In [[theoretical computer science]], the '''closest string''' is an [[NP-hard]] computational problem,<ref name="llmwz">{{citation | title = Distinguishing string selection problems ...

...m]]. 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 i | title = Optimal packing and covering in the plane are NP-complete ...