Strong Reductions and Isomorphism of Complete Sets

DOI10.1007/978-3-540-77050-3_14zbMATH Open1135.68426OpenAlexW1501218275MaRDI QIDQ5458832FDOQ5458832

Authors: Ryan C. Harkins, John M. Hitchcock, Aduri 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

Recommendations

• Strong reductions and isomorphism of complete sets
• Isomorphisms and 1-L reductions
• scientific article; zbMATH DE number 3984574
• Reductions among polynomial isomorphism types
• On the isomorphism conjecture for weak reducibilities

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• On existence of complete sets for bounded reducibilities
• Investigations concerning the structure of complete sets
• Strong reductions and isomorphism of complete sets
• On the isomorphism conjecture for weak reducibilities
• Isomorphisms and 1-L reductions

This page was built for publication: Strong Reductions and Isomorphism of Complete Sets

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