Reducibility among combinatorial problems (1972)

MaRDI QIDQ5075296zbMATH OpenFDO

Authors

Publication date 12 May 2022

Mathematics Subject Classification ID

History of computer science (68-03)

Recommendations

• Reducibility among combinatorial problems
• Reducibility among combinatorial problems
• scientific article; zbMATH DE number 3858462
• A brief history of NP-completeness, 1954--2012
• scientific article; zbMATH DE number 2226428

Cited in

(3)

• Barendregt's problem \#26 and combinatory strong reduction
• Counting independent sets in structured graphs
• On the parameterized complexity of diverse SAT

This page was built for publication: Reducibility among combinatorial problems (1972)

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