In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Dominik Wojtczak
- ArXiv
- 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

- Z. Y. Jiang, F. F. Chen, C. Q. Wu
- JORS
- 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

- Zachary Abel, Erik D. Demaine
- CCCG
- 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

- Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararajan
- WINE
- 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

- Atsushi Sasaki, Tadashi Araragi, Shigeru Masuyama, Keizo Miyata
- IEICE Transactions
- 2005

We formally define the mobile agent allocation problem from a system-wide viewpoint and then prove that it is strongly NPcomplete… (More)

Is this relevant?

2002

2002

- Aduri Pavan, Alan L. Selman
- STACS
- 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

- Silvano Martello, David Pisinger, Daniele Vigo
- Operations Research
- 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

- Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta
- Theor. Comput. Sci.
- 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

- Wing Ning Li
- ICCD
- 1993

The discrete gate sizing problem has been studied by several researchers recently. Some Complexity results have been obtained… (More)

Is this relevant?

Review

1978

Review

1978

- M. R. Garey, David S. Johnson
- J. ACM
- 1978

The NP-completeness of a computational problem ~s frequently taken to unply its "mtractabthty" However, there are certain NP… (More)

Is this relevant?