Productive functions and isomorphisms

DOI10.1007/BF01191472MaRDI QIDQ4327382zbMATH OpenFDO

Authors Jie Wang

Publication date 5 April 1995

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01191472

zbMATH Keywords

complexity classesNP-complete sets

Mathematics Subject Classification ID

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

Recommendations

• On the p-isomorphism conjecture
• scientific article; zbMATH DE number 88948
• One-way functions and the isomorphism conjecture
• On one-way functions and polynomial-time isomorphisms
• On p-creative sets and p-completely creative sets

Cites work

• Collapsing degrees
• Complete Problems and Strong Polynomial Reducibilities
• Completeness, Approximation and Density
• scientific article; zbMATH DE number 4213444 (Why is no real title available?)
• scientific article; zbMATH DE number 88948 (Why is no real title available?)
• scientific article; zbMATH DE number 3560738 (Why is no real title available?)
• Immunity of complete problems
• On Isomorphisms and Density of NP and Other Complete Sets
• On one-way functions and polynomial-time isomorphisms
• On p-creative sets and p-completely creative sets
• Optimal Approximations and Polynomially Levelable Sets
• Reductions among polynomial isomorphism types
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP

Cited in

(6)

• On one-one polynomial time equivalence relations
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
• Productive sets and constructively nonpartial-recursive functions
• Investigations concerning the structure of complete sets
• scientific article; zbMATH DE number 88948 (Why is no real title available?)
• On the p-isomorphism conjecture

This page was built for publication: Productive functions and isomorphisms

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