Closeness of NP-Hard Sets to Other Complexity Classes

DOI10.1137/S0097539792225935zbMath0807.68031OpenAlexW2020219958MaRDI QIDQ4291555

Bin Fu, Hong-zhou Li

Publication date: 16 June 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792225935

zbMATH Keywords

NP-hard setP-closenesspolynomially closeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

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

This page was built for publication: Closeness of NP-Hard Sets to Other Complexity Classes