Hardness of learning loops, monoids, and semirings
From MaRDI portal
Publication:741734
DOI10.1016/j.dam.2013.08.012zbMath1300.68060OpenAlexW2151409752MaRDI QIDQ741734
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.012
Searching and sorting (68P10) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Semirings (16Y60) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Examples of some quasigroups and loops admitting only discrete topologization
- A new bound on the size of the largest critical set in a Latin square
- Spot-checkers
- On the size of the minimum critical set of a Latin square
- Quasigroups in cryptology
- Counting finite groups of given order
- Completing Latin squares: Critical sets II
- On the spectrum of critical sets in latin squares of order 2n
- A superlinear lower bound for the size of a critical set in a latin square