Testing isomorphism of circulant objects in polynomial time

Mikhail Muzychuk, Ilia Ponomarenko

Research output: Contribution to journalArticlepeer-review

Abstract

Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that given two objects X,Y∈K of size n, one can test in polynomial time in n, whether X isomorphic to Y and (if so) find an explicit isomorphism within the same time.

Original languageEnglish
Article number105128
JournalJournal of Combinatorial Theory - Series A
Volume169
DOIs
StatePublished - 1 Jan 2020

Keywords

  • Circulant combinatorial object
  • Graph isomorphism problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Testing isomorphism of circulant objects in polynomial time'. Together they form a unique fingerprint.

Cite this