FCSR PERIODIC MULTISEQUENCES WITH MAXIMAL JOINT N-ADIC COMPLEXITY AND LARGE k-ERROR JOINT N-ADIC COMPLEXITY OVER Z/（N）

相关推荐

• THE 2-ERROR LINEAR COMPLEXITY OF 2^n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2^n -1
• 0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM
• A Method of Estimating Computational Complexity Based on Input Conditions for N-vehicle Problem
• ON SET {N_k~-(x)}_k~n=0
• 关于cos(k/n)π,sin(k/n)π,tg(k/n)π无理性的讨论

同分类资源 更多

• [系统科学] 浅议巧教如何写出英语高分作文
• [系统科学] 奇台县农业气象服务工作现状及对策
• [系统科学] On Consistency in AHP and Fuzzy AHP
• [系统科学] 初探中学化学教学之方法
• [系统科学] 研究输电线路运行维护与日常检修技术

相关关键词