Hardness of learning loops, monoids, and semirings

DOI10.1016/J.DAM.2013.08.012MaRDI QIDQ741734zbMATH OpenOpenAlexFDO

Authors Ching-Lueh Chang

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

zbMATH Keywords

loopmonoidquery complexitysemiring

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Semirings (16Y60) Loops, quasigroups (20N05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 1688371
• Learning expressions and programs over monoids
• Learning matrix functions over rings
• The Quantum Query Complexity of Algebraic Properties
• Efficient algorithmic learning of the structure of permutation groups by examples

Cites work

• A new bound on the size of the largest critical set in a Latin square
• A superlinear lower bound for the size of a critical set in a latin square
• Completing Latin squares: Critical sets II
• Counting finite groups of given order
• Examples of some quasigroups and loops admitting only discrete topologization
• scientific article; zbMATH DE number 1471069 (Why is no real title available?)
• scientific article; zbMATH DE number 1556748 (Why is no real title available?)
• scientific article; zbMATH DE number 1556753 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• On the size of the minimum critical set of a Latin square
• On the spectrum of critical sets in latin squares of order 2n
• Quasigroups in cryptology
• Spot-checkers

This page was built for publication: Hardness of learning loops, monoids, and semirings

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