Referenced Items are not available for this document.
We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class ModkL and for the class DET of problems NC1 reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism
Published in:
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on
Date of Conference: 2000
- Page(s):
- 180 - 186
- Meeting Date :
- 12 Nov 2000-14 Nov 2000
- ISSN :
- 0272-5428
- Print ISBN:
- 0-7695-0850-2
- INSPEC Accession Number:
- 6784303
- Conference Location :
- Redondo Beach, CA
- Digital Object Identifier :
- 10.1109/SFCS.2000.892080
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
