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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2017
0102019752017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
This paper is motivated by the practical control considerations that nonlinearity is abundant in industrial processes and output… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of… (More)
Is this relevant?
2004
2004
We address one of the most fundamental problems concerning the RSA cryptoscheme: Does the knowledge of the RSA public key/ secret… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The quantum version of communication complexity allows Alice and Bob to communicate qubits and/or to make use of prior… (More)
Is this relevant?
1997
1997
We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlock… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We are iiit,erested here in t w o related problems. The first is determining whether we can triangulate a vertex-colored graph… (More)
  • figure 2
  • figure 1
Is this relevant?
1994
1994
This paper presents a new algorithm for the geometric camera calibration of a fish-eye lens (a high distortion lens) mounted on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We consider a class of optimization problems of hierarchical-tree clustering and prove that these problems are NP-hard. The… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1980
1977
1977
We show that certain problems involving sparse polynomials wi th integer coefficients are at least as hard as any problem in NP… (More)
Is this relevant?