z-logo
open-access-imgOpen Access
A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
Publication year - 2021
Publication title -
discrete mathematics letters
Language(s) - English
Resource type - Journals
ISSN - 2664-2557
DOI - 10.47443/dml.2021.0097
Subject(s) - graph isomorphism , equivalence (formal languages) , isomorphism (crystallography) , mathematics , reduction (mathematics) , discrete mathematics , graph , combinatorics , line graph , chemistry , geometry , crystal structure , crystallography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here