Complexity bounds for equivalence and isomorphism of latin squares

DOI10.1016/0020-0190(80)90147-7zbMATH Open0445.68032OpenAlexW2014265354MaRDI QIDQ1145501FDOQ1145501

Authors: Giovanna Sontacchi, Antonio Machì, Corrado Böhm 

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90147-7

zbMATH Keywords

equivalenceisomorphismisotopy between latin squares

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• On the \(n\log{n}\) isomorphism technique (preliminary report)
• Comment verifier l'associativite d'une table de groupe

This page was built for publication: Complexity bounds for equivalence and isomorphism of latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145501)