# On Strong NP-Completeness of Rational Problems

@article{Wojtczak2018OnSN, title={On Strong NP-Completeness of Rational Problems}, author={D. Wojtczak}, journal={ArXiv}, year={2018}, volume={abs/1802.09465} }

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers. We re-examine here the computational complexity of all these problems in the setting where the weights and profits are allowed to be any rational numbers. We show that all of these problems in this setting become strongly NP-complete… Expand

#### Topics from this paper

#### 4 Citations

A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem

- Computer Science
- ArXiv
- 2021

- PDF

Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games

- Mathematics, Computer Science
- MFCS
- 2020

Highly Influenced- PDF

A cost-effectiveness analysis of the number of samples to collect and test from a sexual assault

- Psychology, Medicine
- Proceedings of the National Academy of Sciences
- 2020

- PDF

#### References

SHOWING 1-10 OF 24 REFERENCES

The Knapsack Problem with Conflict Graphs

- Mathematics, Computer Science
- J. Graph Algorithms Appl.
- 2009

86- PDF

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

- Mathematics, Computer Science
- JACM
- 1975

933

On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

- Mathematics, Computer Science
- Math. Oper. Res.
- 1983

159- PDF

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

- Mathematics, Computer Science
- SIAM J. Comput.
- 2005

245

An exact algorithm for large multiple knapsack problems

- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 1999

152

`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

- Mathematics, Computer Science
- JACM
- 1978

599

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date

- Mathematics, Computer Science
- Oper. Res.
- 1994

37- PDF