Properties of NP‐Complete Sets

DOI10.1137/S009753970444421XzbMath1115.68085OpenAlexW1967048340MaRDI QIDQ3434997

Selman, Alan L., A. Pavan, Samik Sengupta, Christian Glaßer

Publication date: 3 May 2007

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

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

zbMATH Keywords

robustnessNP-completenessimmunitydisjoint unionsone-way permutations

Mathematics Subject Classification ID

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

Related Items (3)

Robustness of PSPACE-complete sets ⋮ Autoreducibility, mitoticity, and immunity ⋮ Unions of Disjoint NP-Complete Sets

This page was built for publication: Properties of NP‐Complete Sets