Abstract
Motivated by the question of determining the difference in complexity between the graph-isomorphism and graph-automorphism problems, we study the relationship between the coset-intersection (C-INT) and group-intersection (G-INT) problems in permutation groups. We prove that G-INT is related to C-INT asymmetrically under Ogiwara and Watanabe's notions of left and right sets. This asymmetry suggests that, for given two permutation groups that intersect nontrivially, finding the least nonidentity element in the intersection is likely to be easier than finding the largest nonidentity element in the intersection under any lexicographic ordering. Also as a consequence, unless C-INT (resp., G-INT) ∈P, C-INT (resp., G-INT) is not many-one reducible in polynomial time to any sparse set.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
