On polynomial time isomorphisms of some new complete sets

DOI10.1016/0022-0000(78)90027-2MaRDI QIDQ1245571zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 1978

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(78)90027-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3713182 (Why is no real title available?)
• scientific article; zbMATH DE number 3532523 (Why is no real title available?)
• scientific article; zbMATH DE number 3560738 (Why is no real title available?)
• scientific article; zbMATH DE number 3582425 (Why is no real title available?)
• scientific article; zbMATH DE number 3589730 (Why is no real title available?)
• On Isomorphisms and Density of NP and Other Complete Sets
• On the Structure of Polynomial Time Reducibility
• The complexity of theorem-proving procedures

This page was built for publication: On polynomial time isomorphisms of some new complete sets

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