A note on closeness between \(NP\)-hard sets and \(C_= P\)

DOI10.1007/BF02948804zbMath0953.68059MaRDI QIDQ1975447

Tian Liu

Publication date: 27 April 2000

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

NP-hard sets

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Closeness of NP-Hard Sets to Other Complexity Classes
• Generalized theorems on relationships among reducibility notions to certain complexity classes

This page was built for publication: A note on closeness between \(NP\)-hard sets and \(C_= P\)