助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   概率多项式时间算法 的翻译结果: 查询用时:0.009秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

概率多项式时间算法
相关语句
  probabilistic polynomial time algorithm
     In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs.
     本文给出了一个新的匹配协议,该协议是语义安全的,不存在概率多项式时间算法区分对两个输入的猜测值。
短句来源
  相似匹配句对
     Probability Polynomial and Its Application
     概率多项式及其应用
短句来源
     The application of orthogonal polynomial in researching probability density function
     正交多项式概率密度研究中的应用
短句来源
     Some Results On Probabilistic Polynomial—time Hierarchy
     关于概率多项式时间谱系的一些结果
短句来源
     Orthogonal Polynomial
     正交多项式
短句来源
     Probability Experiments
     概率实验
短句来源
查询“概率多项式时间算法”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  probabilistic polynomial time algorithm
We construct a probabilistic polynomial time algorithm that computes the mixed discriminant of given n positive definite matrices within a 2O(n) factor.
      


In this paper, two classes of directed networksORCnetworks and IRCnetworks are defined, and a polynomial time algorithm is presented for computing their rooted communication reliability, i.e. the probability that a specified vertex, root vertex, can communicate with all other vertices. The complexity of the algorithm for ORCnetworks and IRCnetworks is O(|E|) and O(|V||E|) respectively, where |V| and |E| are the number of vertices and of edges of networks respectively.

定义了两类有向网络——ORC-网络和IRC-网络,并且提出一个计算它们的根通信可靠性(网络的一个特定结点(根点)能与其余每个结点通信的概率)的多项式时间算法.对于ORC-网络和IRC-网络,该算法的时间复杂度分别是O(|E|)和O(|V|·|E|),这里,|V|,|E|分别表示网络所含结点和边的数量

The protocol of compare of two secret integers is known as the match protocol. Up to now most of such protocols are either inefficient or insecure under the dictionary attacks. In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs. It js also efficient: the protocol can compare two large secret integers and require only O(1)rounds of communications and O(1) modular exponentiations, and prevent one...

The protocol of compare of two secret integers is known as the match protocol. Up to now most of such protocols are either inefficient or insecure under the dictionary attacks. In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs. It js also efficient: the protocol can compare two large secret integers and require only O(1)rounds of communications and O(1) modular exponentiations, and prevent one player from cheating the other at the cost of only a bit more computations. The protocol is suited to be used in password authentication, electronic lotteries, publicly verifiable encryption, etc.

比较两个秘密整数是否相等这类协议称为匹配协议。目前这样的协议要么效率极低,要么不能抗击字典攻击。本文给出了一个新的匹配协议,该协议是语义安全的,不存在概率多项式时间算法区分对两个输入的猜测值。协议是高效的,可以比较两个大整数是否相等,计算复杂性和通信复杂性都为O(1),可以验证参与者是否诚实。该协议可以用于口令认证、电子彩票、可证实加密等安全协议设计。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关概率多项式时间算法的内容
在知识搜索中查有关概率多项式时间算法的内容
在数字搜索中查有关概率多项式时间算法的内容
在概念知识元中查有关概率多项式时间算法的内容
在学术趋势中查有关概率多项式时间算法的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社