A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence

Guardado en:

Detalles Bibliográficos
Autores principales:	Simeon Ball, James Dixon
Formato:	article
Lenguaje:	EN
Publicado:	Discrete Mathematics Letters 2021
Materias:	additive codes multi-graph isomorphism problem code equivalence Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/138ddec19b7f4145a41dc6848072be71
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:138ddec19b7f4145a41dc6848072be71
record_format	dspace
spelling	oai:doaj.org-article:138ddec19b7f4145a41dc6848072be712021-12-03T08:10:34ZA polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence10.47443/dml.2021.00972664-2557https://doaj.org/article/138ddec19b7f4145a41dc6848072be712021-12-01T00:00:00Zhttps://www.dmlett.com/archive/v8/DML22_v8_pp66-68.pdfhttps://doaj.org/toc/2664-2557Simeon BallJames DixonDiscrete Mathematics Lettersarticleadditive codesmulti-graph isomorphism problemcode equivalenceMathematicsQA1-939ENDiscrete Mathematics Letters, Vol 8, Pp 66-68 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	additive codes multi-graph isomorphism problem code equivalence Mathematics QA1-939
spellingShingle	additive codes multi-graph isomorphism problem code equivalence Mathematics QA1-939 Simeon Ball James Dixon A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
format	article
author	Simeon Ball James Dixon
author_facet	Simeon Ball James Dixon
author_sort	Simeon Ball
title	A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
title_short	A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
title_full	A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
title_fullStr	A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
title_full_unstemmed	A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
title_sort	polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
publisher	Discrete Mathematics Letters
publishDate	2021
url	https://doaj.org/article/138ddec19b7f4145a41dc6848072be71
work_keys_str_mv	AT simeonball apolynomialtimereductionfromthemultigraphisomorphismproblemtoadditivecodeequivalence AT jamesdixon apolynomialtimereductionfromthemultigraphisomorphismproblemtoadditivecodeequivalence AT simeonball polynomialtimereductionfromthemultigraphisomorphismproblemtoadditivecodeequivalence AT jamesdixon polynomialtimereductionfromthemultigraphisomorphismproblemtoadditivecodeequivalence
_version_	1718373371482210304

A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence

Ejemplares similares