In computational complexity theory, a polynomial-time reduction is a method for solving one problem using another. One shows that if a hypothetical subroutine...

term reduction was used in the technical meaning of a polynomial-time many-one reduction. Another type of reduction is polynomial-time Turing reduction. A...

non-deterministic polynomial-time, there is a polynomial-time reduction from L to H. That is, assuming a solution for H takes 1 unit time, H's solution can...

within the hierarchy have complete problems (with respect to polynomial-time reductions) that ask if quantified Boolean formulae hold, for formulae with...

computational complexity theory of counting problems, a polynomial-time counting reduction is a type of reduction (a transformation from one problem to another)...

reductions are also polynomial-time reductions. However, log-space reductions are probably weaker than polynomial-time reductions; while any non-empty, non-full...

assumes the form of e.g. polynomial-time reduction. Further, in the even more practical domain of software development, reduction can be seen as the inverse...

version of the shortest vector problem (SVP) in a lattice (a polynomial-time reduction from this SVP problem to the RLWE problem has been presented)...

used (m : many-one reduction, p : polynomial reduction). The mathematical structure generated on a set of problems by the reductions of a particular type...

complexity of reductions, such as polynomial-time reductions or log-space reductions. The most commonly used reduction is a polynomial-time reduction. This means...

P-complete under polynomial-time reductions. If we use NC reductions, that is, reductions which can operate in polylogarithmic time on a parallel computer...

computer science, a polynomial-time algorithm is – generally speaking – an algorithm whose running time is upper-bounded by some polynomial function of the...

projections where each subsequent reduction notion is weaker than the prior; see polynomial-time reduction and log-space reduction for details. Given decision...

Light Up puzzle is solvable is NP-complete. This is proved by a polynomial-time reduction from Circuit-SAT, which is known to be NP-complete, to Light Up...

In computer science (particularly algorithmics), a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems...

can vary based on resource bounds, such as polynomial-time reductions and log-space reductions. Reductions motivate the concept of a problem being hard...

Polynomial-time function problems are fundamental in defining polynomial-time reductions, which are used in turn to define the class of NP-complete problems...

symbols Order theory Partially ordered set Directional symbols Polynomial-time reduction Cooley, Brandon. "Ordered Sets" (PDF) (Lecture note for: Introduction...

if L is in co-NP and for any problem in co-NP, there exists a polynomial-time reduction from that problem to L. Determining if a formula in propositional...

may refer to: Polynomial-time approximation scheme, an approximation algorithm in computer science Pesetas, Spanish currency PTAS reduction, an approximation-preserving...

this reduction is more liberal than the standard reduction used in computational complexity (sometimes called polynomial-time many-one reduction); for...

polynomial-time non-deterministic Turing machine. The problem is #P-hard, meaning that every other problem in #P has a Turing reduction or polynomial-time...

and is in fact complete for exponential space with respect to polynomial-time reduction. For a fixed finite alphabet, the theory of the set of all languages...

is computationally equivalent to factoring N (in the sense of polynomial-time reduction). Hence it can be proven that the Rabin collection is one-way...

is NP-complete. Schaefer gives a construction allowing an easy polynomial-time reduction from 3-SAT to one-in-three 3-SAT. Let "(x or y or z)" be a clause...

parameter k is said to admit a linear vertex kernel if there is a polynomial time reduction, called a kernelization algorithm, that maps the input instance...

machine in polynomial time, with an error probability of less than 1/2 for all instances. The abbreviation PP refers to probabilistic polynomial time. The complexity...

polylogarithmic polynomial polynomial-time approximation scheme (PTAS) polynomial hierarchy polynomial time polynomial-time Church–Turing thesis polynomial-time reduction...

Proving Procedures", Cook formalized the notions of polynomial-time reduction (also known as Cook reduction) and NP-completeness, and proved the existence...

show the Valiant–Vazirani theorem: there exists a randomized polynomial-time reduction from the satisfiability problem for Boolean formulas to the problem...