Strong Reductions and Isomorphism of Complete Sets

DOI10.1007/978-3-540-77050-3_14zbMath1135.68426OpenAlexW1501218275MaRDI QIDQ5458832

Ryan C. Harkins, John M. Hitchcock, A. Pavan

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_14

Mathematics Subject Classification ID

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

Related Items

Investigations Concerning the Structure of Complete Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• Comparing reductions to NP-complete sets
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
• Isomorphisms and 1-L reductions
• Almost everywhere high nonuniform complexity
• Reductions in circuit complexity: An isomorphism theorem and a gap theorem
• Resource bounded randomness and weakly complete problems
• On Isomorphisms and Density of $NP$ and Other Complete Sets
• A First-Order Isomorphism Theorem
• Reducing the complexity of reductions