Strong NP-completeness

Known as: Strongly NP-complete, Strongly NP-hard 
In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2018
051019782018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems… (More)
Is this relevant?
2013
2013
The 3-PARTITION problem has been widely used in the proof of the strong NP-completeness result because this problem is NP… (More)
Is this relevant?
2011
2011
We prove that it is strongly NP-complete to decide whether a given orthogonal polyhedron has a (nonoverlapping) edge unfolding… (More)
Is this relevant?
2007
2007
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can… (More)
Is this relevant?
2005
2005
We formally define the mobile agent allocation problem from a system-wide viewpoint and then prove that it is strongly NPcomplete… (More)
  • figure 1
Is this relevant?
2002
2002
We prove that if for some ǫ > 0, NP contains a set that is DTIME(2n ǫ )-bi-immune, then NP contains a set that is 2-Turing… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum… (More)
Is this relevant?
1996
1996
Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a… (More)
Is this relevant?
1993
1993
The discrete gate sizing problem has been studied by several researchers recently. Some Complexity results have been obtained… (More)
  • figure 3
Is this relevant?
Review
1978
Review
1978
The NP-completeness of a computational problem ~s frequently taken to unply its "mtractabthty" However, there are certain NP… (More)
Is this relevant?