On linear operators injective on arbitrary subsets

Lobachevskii Journal of Mathematics(2015)

引用 0|浏览0
暂无评分
摘要
Linear operators injective on subsets of a linear space over GF ( p ) are considered. It is shown that, given any positive constant ε , any sufficiently large n , and any domain D in GF n ( p ), there exists a linear operator injective on this domain whose rank is at most (2 + ε ) log p | D | and complexity is O ( n ).
更多
查看译文
关键词
perfect linear hashing, combinatorial circuits, circuit complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要