Abstract
We show that isomorphism testing of two cyclic combinatorial objects may be done in a polynomial time provided that both objects share the same regular cyclic group of automorphisms given in advance.
| Original language | American English |
|---|---|
| Pages (from-to) | 973-975 |
| Number of pages | 3 |
| Journal | Acta Mathematica Universitatis Comenianae |
| Volume | 88 |
| Issue number | 3 |
| State | Published - 2 Sep 2019 |
Keywords
- Cyclic Combinatorial Objects
- Isomorphism problem
- Polynomial time algorithm
All Science Journal Classification (ASJC) codes
- General Mathematics