A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence
Guardado en:
Autores principales: | Simeon Ball, James Dixon |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Discrete Mathematics Letters
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/138ddec19b7f4145a41dc6848072be71 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Binary Cyclic Pearson Codes
por: Ari Dwi Hartanto, et al.
Publicado: (2021) -
Low velocity vehicle impact against building structures: An outline of relevant codes
por: Ferrer,B, et al.
Publicado: (2010) -
Multi-Hypothesis Topological Isomorphism Matching Method for Synthetic Aperture Radar Images with Large Geometric Distortion
por: Runzhi Jiao, et al.
Publicado: (2021) -
Reproducible families of codes and cryptographic applications
por: Santini Paolo, et al.
Publicado: (2021) -
Graph Analysis Using Fast Fourier Transform Applied on Grayscale Bitmap Images
por: Pawel Baszuro, et al.
Publicado: (2021)