Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,712,841 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial-time reduction
Known as:
Polynomial time equivalent
, Polynomial-time many-one reduction
, Polynomial-time Turing reduction
Expand
In computational complexity theory, a polynomial-time reduction is a method of solving one problem by means of a hypothetical subroutine for solving…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
41 relations
Algorithm
Boolean satisfiability problem
Church–Turing thesis
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An efficient advanced Adomian decomposition method to solve second-order boundary value problems with Neumann conditions
W. Al-Hayani
2015
Corpus ID: 125517072
In this paper, the advanced Adomian decomposition method is applied to solve linear and nonlinear boundary value problems with…
Expand
2012
2012
Low-energy Formulations of Support Vector Machine Kernel Functions for Biomedical Sensor Applications
Kyong-Ho Lee
,
S. Kung
,
N. Verma
Journal of Signal Processing Systems
2012
Corpus ID: 14053552
Although physiologically-indicative signals can be acquired in low-power biomedical sensors, their accurate analysis imposes…
Expand
2007
2007
Squared polynomial extrapolation methods with cycling: an application to the positron emission tomography problem
C. Roland
,
R. Varadhan
,
C. E. Frangakis
Numerical Algorithms
2007
Corpus ID: 43554182
Roland and Varadhan (Appl. Numer. Math., 55:215–226, 2005) presented a new idea called “squaring” to improve the convergence of…
Expand
2002
2002
A multiplier-less 1-D and 2-D fast Fourier transform-like transformation using sum-of-powers-of-two (SOPOT) coefficients
S. Chan
,
P. Yiu
IEEE International Symposium on Circuits and…
2002
Corpus ID: 33713159
This paper proposes a new multiplier-less approximation of the 1D discrete Fourier transform (DFT) called the multiplierless fast…
Expand
1999
1999
Min-max timing analysis and an application to asynchronous circuits
Supratik Chakraborty
,
D. Dill
,
K. Yun
Proceedings of the IEEE
1999
Corpus ID: 12733473
Modern high-performance asynchronous circuits depend on timing constraints for correct operation, so timing analyzers are…
Expand
1994
1994
Efficient Disambiguation by means of Stochastic Tree Substitution Grammars
L.W.M. Bod
,
Steven Krauwer
,
R. Scha
,
K. Sima'an
1994
Corpus ID: 9587615
In Stochastic Tree Substitution Grammars (STSGs), one parse(tree) of an input sentence can be generated by exponentially many…
Expand
1992
1992
A pin permutation algorithm for improving over-the-cell channel routing
C. Chen
,
C. Y. Hou
[] Proceedings 29th ACM/IEEE Design Automation…
1992
Corpus ID: 18335609
A dynamic-programming-based algorithm is presented to determine proper gate and terminal positions such that, when over-the-cell…
Expand
1988
1988
A simple algorithm for arbitrary polynomial transformation
J. Heinen
,
Bari M. A. Siddique
IEEE Transactions on Acoustics Speech and Signal…
1988
Corpus ID: 32698093
A very simple algorithm is developed for the arbitrary rational transformation of a polynomial. The fact that many of the…
Expand
1986
1986
An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations
Ahlem Ben Cherifa
,
P. Lescanne
CADE
1986
Corpus ID: 6864966
A method based on polynomial interpretations is currently implemented in REVE. Though this termination check procedure is…
Expand
1984
1984
On NP-Hardness in Hierarchical Clustering
M. Krivánek
,
J. Morávek
1984
Corpus ID: 117548060
We consider a class of optimization problems of the hierarchical-tree clustering, and prove that these problems are NP-hard. The…
Expand