全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 概率多项式 的翻译结果: 查询用时：0.085秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 概率多项式
 probability polynomial
 Probability Polynomial and Its Application 概率多项式及其应用 短句来源
 probabilistic polynomial
 Some Results On Probabilistic Polynomial—time Hierarchy 关于概率多项式时间谱系的一些结果 短句来源 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. 本文给出了一个新的匹配协议,该协议是语义安全的,不存在概率多项式时间算法区分对两个输入的猜测值。 短句来源
 “概率多项式”译为未确定词的双语例句
 In this paper, they study the structure properties of probabilistic polynomial-time hierarchy and prove the following results . (1) If BP∑_(k+1)~pBP∑_k~p, then PH=BP∑_k~P; 研究概率多项式时间谱系的结构性质,证明了:(1)如果BP∑_(k+1)~pBP∑_k~P,则PH=BP∑∏_K~P; 短句来源 (4)For every n, k≥1,BP∑_n~P(BP∑_k~pBP_k~p)=BP∑_(n+k-1)~p·These results show that the probabilistic polynomial-time hierarchy has the same structure properties as the polynomial-time hierarchy, but they also have diffrence. (4)对任意n,k≥1,BP∑_n~P(BP∑_k~p∩BP∏_k~P)=BP∑_(n+k-1)~P这些结果说明概率多项式时间谱系与多项式时间谱系有相同的结构性盾,但也有差别. 短句来源
 相似匹配句对
 Probability Polynomial and Its Application 概率多项式及其应用 短句来源 The application of orthogonal polynomial in researching probability density function 正交多项式在概率密度研究中的应用 短句来源 Probabilistic Logic Programming 概率逻辑程序 短句来源 Orthogonal Polynomial 正交多项式 短句来源 Probability Experiments 概率实验 短句来源

我想查看译文中含有：的双语例句

 probabilistic polynomial
 A probabilistic polynomial-time prover with the appropriate trapdoor knowledge is sufficient. This treatment is appropriate for cryptographic settings modeled by probabilistic polynomial-time machines. [ACGS] that the following problems are equivalent by probabilistic polynomial time reductions: (1) given EN(x) find x; (2) given EN(x) predict the least-significant bit of x with success probability 1/2 + 1/poly(n) , where N has n bits. The security guarantee holds with respect to probabilistic polynomial-time adversaries that control the communication channel (between the parties), and may omit, insert, and modify messages at their choice. We introduce generalized notions of low and high complexity classes and study their relation to structural questions concerning bounded probabilistic polynomial-time complexity classes. 更多
 In this paper, they study the structure properties of probabilistic polynomial-time hierarchy and prove the following results .(1) If BP∑_(k+1)~pBP∑_k~p, then PH=BP∑_k~P;(2) If BP∑_k~pBP_k~p,then PH=BP∑_k~p=BP_k~p;(3)For every n, k≥0, BP∑_n~p(BP∑_k~p)=BP∑_(n+k)~P,BP∑_n~P,(BP△_(k+1)~p)=BP∑_(n+k)~p;(4)For every n, k≥1,BP∑_n~P(BP∑_k~pBP_k~p)=BP∑_(n+k-1)~p·These results show that the probabilistic polynomial-time hierarchy has the same structure properties as the polynomial-time hierarchy, but they also have diffrence.... In this paper, they study the structure properties of probabilistic polynomial-time hierarchy and prove the following results .(1) If BP∑_(k+1)~pBP∑_k~p, then PH=BP∑_k~P;(2) If BP∑_k~pBP_k~p,then PH=BP∑_k~p=BP_k~p;(3)For every n, k≥0, BP∑_n~p(BP∑_k~p)=BP∑_(n+k)~P,BP∑_n~P,(BP△_(k+1)~p)=BP∑_(n+k)~p;(4)For every n, k≥1,BP∑_n~P(BP∑_k~pBP_k~p)=BP∑_(n+k-1)~p·These results show that the probabilistic polynomial-time hierarchy has the same structure properties as the polynomial-time hierarchy, but they also have diffrence. 研究概率多项式时间谱系的结构性质,证明了:(1)如果BP∑_(k+1)~pBP∑_k~P,则PH=BP∑∏_K~P;(2)如果BP∑_k~PBP∏_k~P,则;PH=BP∑_K~PP;(3)对任意n,k≥0,BP∑_K~P(BP∑_n~P)=BP∑_(n+k)~p,BP∑_n~P(BP△_(k+1)~P)=BP∑_(n+k)~n;(4)对任意n,k≥1,BP∑_n~P(BP∑_k~p∩BP∏_k~P)=BP∑_(n+k-1)~P这些结果说明概率多项式时间谱系与多项式时间谱系有相同的结构性盾,但也有差别. 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. 定义了两类有向网络——ＯＲＣ－网络和ＩＲＣ－网络，并且提出一个计算它们的根通信可靠性（网络的一个特定结点（根点）能与其余每个结点通信的概率）的多项式时间算法．对于ＯＲＣ－网络和ＩＲＣ－网络，该算法的时间复杂度分别是Ｏ（｜Ｅ｜）和Ｏ（｜Ｖ｜·｜Ｅ｜），这里，｜Ｖ｜，｜Ｅ｜分别表示网络所含结点和边的数量 In this paper,we introduce the terminology of Probability Polynomial and give the probability expression formula for an event in terms of the intersection of several other events in probability space by using contribute principle in combinatorics enumeration.\; 本文引入概率多项式的概念 ,利用组合数学计数理论中“贡献法原理”给出概率空间任一事件的概率由若干事件交的概率表达公式。 << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社