A polynomial-time reduction from the multi-graph isomorphism problem to additive codeequivalence
View/Open
Document typeArticle
Defense date2021-12-02
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution 3.0 Spain
Abstract
CitationBall, S.; Dixon, J. A polynomial-time reduction from the multi-graph isomorphism problem to additive codeequivalence. "Discrete mathematics letters", 2 Desembre 2021, vol. 8, p. 66-68.
ISSN2664-2557
Publisher versionhttps://www.dmlett.com/archive/v8/DML22_v8_pp66-68.pdf
| Files | Description | Size | Format | View |
|---|---|---|---|---|
| additivecodemultigraph.pdf | 171,2Kb | View/Open |