Scalability and the Isomorphism Problem

Scalable sets are defined and their properties studied. It is shown that the set of scalable sets is the isomorphism closure of the set of rankable sets and that every scalable set is P-isomorphic to some rankable set. Scalable sets coincide with P-printable sets when sparse, and with P-paddable sets when thick. Using scalability as a tool, the P-isomorphism question for polynomial-time computable sets of similar densities is examined.

[1]  Andrew V. Goldberg,et al.  Compression and Ranking , 1991, SIAM J. Comput..

[2]  Eric Allender,et al.  The Complexity of Sparse Sets in P , 1986, SCT.

[3]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[4]  Alan L. Selman,et al.  Polynomial Time Enumeration Reducibility , 1978, SIAM J. Comput..

[5]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[6]  Dung T. Huynh,et al.  The complexity of ranking , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[7]  Paul Young,et al.  Reductions Among Polynomial Isomorphism Types , 1985, Theor. Comput. Sci..

[8]  Lane A. Hemaspaandra,et al.  On the Complexity of Ranking , 1990, J. Comput. Syst. Sci..

[9]  Lane A. Hemaspaandra,et al.  On Sets Polynomially Enumerable by Iteration , 1991, Theor. Comput. Sci..

[10]  Deborah Joseph,et al.  Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP , 1985, Theor. Comput. Sci..

[11]  Paul R. Young,et al.  Toward a Theory of Enumerations , 1968, JACM.