• It also shows its security and certifies its communication complexity and time complexity.

    讨论了其安全性并证明了该机制的通信复杂度与时间复杂度。

    youdao

  • By analyzing the scheme, we conclude that its computational complexity and communication complexity is lower than Zhengzhuo's scheme.

    比较和分析可知该方案的计算与通信复杂度均略低于郑卓等人的方案。

    youdao

  • This paper discusses the parallel FFT algorithm on the hypercube architecture. Based on the analysis of the communication complexity, the speedup of the algorithm is derived.

    本文讨论超立方体结构上的并行fft算法,着重分析算法的通信复杂性,并在此基础上导出算法的加速比。

    youdao

  • This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.

    本文讨论超立方体结构上的并行归并排序算法,着重分析算法的通信复杂性,在此基础上推导算法的加速比。

    youdao

  • This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.

    本文讨论超立方体结构上的并行归并排序算法,着重分析算法的通信复杂性,在此基础上推导算法的加速比。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定