scientific article; zbMATH DE number 4047100

MaRDI QIDQ3783559zbMATH OpenFDO

Authors J. Hartmanis

Publication date 1987

zbMATH Keywords

NP-complete setssurvey

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4106271
• Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory
• Properties of NP‐Complete Sets
• scientific article; zbMATH DE number 4080915
• scientific article; zbMATH DE number 1072532

Cited in

(6)

• More complicated questions about maxima and minima, and some closures of NP
• scientific article; zbMATH DE number 5527901 (Why is no real title available?)
• NP-Creative sets: A new class of creative sets in NP
• Parallel complexity of iterated morphisms and the arithmetic of small numbers
• New developments in structural complexity theory
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations

This page was built for publication:

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