On a criterion of NP-completeness

DOI10.1007/BF02514208MaRDI QIDQ4946793zbMATH OpenOpenAlexFDO

Authors V. K. Bulitko, V. V. Bulitko

Publication date 23 March 2000

Published in Ukrainian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02514208

zbMATH Keywords

completeness of setsCook theoremNP-completeness

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A note on complete problems for complexity classes
• scientific article; zbMATH DE number 4106271
• The complexity of satisfiability problems
• Positive relativizations of the \(P=?\) NP problem
• NP-Creative sets: A new class of creative sets in NP

Cited in

(1)

• scientific article; zbMATH DE number 4106815 (Why is no real title available?)

This page was built for publication: On a criterion of NP-completeness

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