On Strong NP-Completeness of Rational Problems

  title={On Strong NP-Completeness of Rational Problems},
  author={D. Wojtczak},
  • D. Wojtczak
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
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
4 Citations
A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem
  • PDF
Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games
  • Highly Influenced
  • PDF
Effcient Projection Onto the Nonconvex 𝓁p-ball
A cost-effectiveness analysis of the number of samples to collect and test from a sexual assault
  • PDF


The Knapsack Problem with Conflict Graphs
  • 86
  • PDF
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
  • 933
Knapsack Problems
  • 756
  • PDF
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
  • 159
  • PDF
Quadratic knapsack problems
  • 279
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
  • 245
The complexity of satisfiability problems
  • 1,859
  • PDF
An exact algorithm for large multiple knapsack problems
  • 152
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
  • 599
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
  • 37
  • PDF