This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th Annual Symposium on Foundations of Computer Science (FOCS 1986)
Three results on the polynomial isomorphism of complete sets
October 27-October 29
ISBN: 0-8186-0740-8
ASCII Text
x 
 
Judy Goldsmith, Deborah Joseph, "Three results on the polynomial isomorphism of complete sets," Foundations of Computer Science, IEEE Annual Symposium on, pp. 390-397, 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), 1986.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.1986.56,
author = {Judy Goldsmith and Deborah Joseph},
title = {Three results on the polynomial isomorphism of complete sets},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1986},
issn = {0272-5428},
pages = {390-397},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1986.56},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Three results on the polynomial isomorphism of complete sets
SN - 0272-5428
SP390
EP397
A1 - Judy Goldsmith,
A1 - Deborah Joseph,
PY - 1986
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
This paper proves three results relating to the isomorphism question for NP-complete sets. Result 1: We construct an oracle A such that SATA is ≤mP- complete for NPA and all ≤mP-complete sets for NPA are pA- isomorphic to SATA. Result 2: We construct a time function T(n) such that DTIME(T(n)) contains btt-complete sets, which are many-one equivalent, but are not p-isomorphic. The proof of this result has two corollaries: 1) There is an oracle, D, such that NPD contains non-p-isomorophic ≤m(D),P-complete sets. 2) There is a ≤mP-degree that contains non-p-isomorphic sets. Result 3: We show that no simple modification of the diagonalization argument used by Ko, Long and Du can be used to produce sets that are both EXPtime-complete w.r.t, polynomial many-one reducibility and not p-isomorphic.
Citation:
Judy Goldsmith, Deborah Joseph, "Three results on the polynomial isomorphism of complete sets," focs, pp.390-397, 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), 1986
Usage of this product signifies your acceptance of the Terms of Use.