A computational approach to analyze the Hadamard quasigroup product
From MaRDI portal
Publication:6153084
Cites work
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- Enumerating partial Latin rectangles
- Enumeration of Latin squares with conjugate symmetry
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- scientific article; zbMATH DE number 6473829 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 7564205 (Why is no real title available?)
- Isomorphism invariants for linear quasigroups
- On the number of 8 8 Latin squares
- Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving
- Small latin squares, quasigroups, and loops
- Sudokus and Gröbner Bases: Not Only a Divertimento
- Sylow theory for quasigroups. II: Sectional action.
- The number of Latin squares of order 11
This page was built for publication: A computational approach to analyze the Hadamard quasigroup product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153084)