Skip to search formSkip to main contentSkip to account menu

Polynomial-time reduction

Known as: Polynomial time equivalent, Polynomial-time many-one reduction, Polynomial-time Turing reduction 
In computational complexity theory, a polynomial-time reduction is a method of solving one problem by means of a hypothetical subroutine for solving… 
Wikipedia (opens in a new tab)

Related topics

Related topics

41 relations
AlgorithmBoolean satisfiability problemChurch–Turing thesisComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
The Orbit Problem consists of determining, given a linear transformation A on d-dimensional rationals Q^d, together with vectors… 
2014
2014
Several gradient parameter estimation algorithms for dual-rate sampled systems
2012
2012
Low-energy Formulations of Support Vector Machine Kernel Functions for Biomedical Sensor Applications
Although physiologically-indicative signals can be acquired in low-power biomedical sensors, their accurate analysis imposes… 
2008
2008
Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
Interaction systems are a formal model for component-based systems, where components are combined via connectors to form more… 
2002
2002
The uniqueness of polynomial crystallographic actions
Abstract. Let $\Gamma$ be a polycyclic-by-finite group. It is proved in [8] that $\Gamma$ admits a polynomial action of bounded… 
Highly Cited
1999
Highly Cited
1999
An approach to partner selection in agile manufacturing
It is believed that agile manufacturing is the twenty-first century manufacturing enterprise strategy and should be realized by… 
1997
1997
On Dynamic Algorithms for Algebraic Problems
In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, iff(x1,x2,?,xn)=(y1,y2,?,ym… 
1994
1994
Efficient Disambiguation by means of Stochastic Tree Substitution Grammars
In Stochastic Tree Substitution Grammars (STSGs), one parse(tree) of an input sentence can be generated by exponentially many… 
1992
1992
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions
It has long been known that if SAT is reducible to a sparse set by more restrictive polynomial time reductions, then even more… 
1988
1988
A simple algorithm for arbitrary polynomial transformation
A very simple algorithm is developed for the arbitrary rational transformation of a polynomial. The fact that many of the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)