Complexity bounds for equivalence and isomorphism of latin squares
From MaRDI portal
Publication:1145501
DOI10.1016/0020-0190(80)90147-7zbMath0445.68032OpenAlexW2014265354MaRDI QIDQ1145501
Giovanna Sontacchi, Corrado Böhm, Antonio Machì
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
Analysis of algorithms and problem complexity (68Q25) Orthogonal arrays, Latin squares, Room squares (05B15) Discrete mathematics in relation to computer science (68R99)
Cites Work