scientific article; zbMATH DE number 88948

MaRDI QIDQ4016525zbMATH OpenFDO

Authors Jie Wang

Publication date 16 January 1993

zbMATH Keywords

\(p\)- invertible \(p\)-productive functions\(p\)-creative setsBerman-Hartmanis isomorphism conjectureDEXT

Mathematics Subject Classification ID

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

Recommendations

• The isomorphism conjecture for NP
• Productive functions and isomorphisms
• On the isomorphism conjecture for weak reducibilities
• On p-creative sets and p-completely creative sets
• On one-way functions and polynomial-time isomorphisms

Cited in

(6)

• One-way functions and the isomorphism conjecture
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
• Investigations concerning the structure of complete sets
• The isomorphism conjecture for NP
• Productive functions and isomorphisms
• NP-Creative sets: A new class of creative sets in NP

This page was built for publication:

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