Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Towards Uniform AC -Isomorphisms
 

Summary: Towards Uniform AC

-Isomorphisms
Manindra Agrawal
Department of Computer Science
IIT Kanpur
Kanpur 208016, India
manindra@iitk.ac.in
Abstract
For any class ¡ closed under NC¢ reductions, it is shown
that all sets complete for ¡ under logspace-uniform AC£
reductions are isomorphic under logspace-uniform AC£ -
computable isomorphisms.
1 Introduction
One of the long-standing conjecture about the struc-
ture of complete sets is the isomorphism conjecture (pro-
posed in [9]) stating that all sets complete for NP under
polynomial-time reductions are polynomial time isomor-
phic. Recently this conjecture was shown to be true in
a restricted setting: all sets complete for NP under (non-

  

Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

 

Collections: Computer Technologies and Information Sciences