Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems

DOI10.1006/JCOM.1994.1010zbMath0809.90131OpenAlexW2027861924MaRDI QIDQ1333241

Martin Trudeau, Moshe Dror, Benjamin T. Smith

Publication date: 5 April 1995

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1994.1010

zbMATH Keywords

polynomial timeexistence of a solutionNP- complete problemsnonnegative linear diophantine equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Diophantine equations (11D99)

Related Items (2)

Universal number partition problem with divisibility ⋮ PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM

This page was built for publication: Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems