Hard instances of hard problems

DOI10.1007/3-540-46541-3_27MaRDI QIDQ4501544zbMATH OpenFDO

Authors Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan

Publication date 4 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46541-3_27

zbMATH Keywords

instance complexities

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 4001485
• On hard instances
• NP-hard sets have many hard instances
• Instance complexity

Cited in

(9)

• On hard instances
• New hard benchmark for flowshop scheduling problems minimising makespan
• scientific article; zbMATH DE number 403953 (Why is no real title available?)
• Resource-bounded instance complexity
• NP-hard sets have many hard instances
• scientific article; zbMATH DE number 4001485 (Why is no real title available?)
• scientific article; zbMATH DE number 5234254 (Why is no real title available?)
• Hard instances of algorithms and proof systems
• The size of SPP

This page was built for publication: Hard instances of hard problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501544)