Retrieving information from algebraic structuresin sublinear time
碩士 === 元智大學 === 資訊工程學系 === 102 === Chang (Discrete Applied Mathematics, 162(1): 149--158, 2014) shows that each randomized o(|G|^2 )-query algorithm can recover only an expected o(1) fraction of the multiplication table of some finite abelian loop (G,⋅), where both multiplication and inversion queri...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/66688845602517171667 |