probabilistic polynomial timeprobabilistic timeBarak techniquestranslation argumentPSPACE-complete problemworst-case probabilistic algorithmWe show a hierarchy for probabilistic time with one bit of advice, specifically we show that for all real numbers 1 /spl les/ /spl alpha/ /spl les/ /spl beta/, ...
Here 'uniform' means that there exists a classical algorithm that outputs a description of Cn in time polynomial in n. Note that, by a result of Shi [31], we can assume without loss of generality that Cn is composed only of Hadamard and Toffoli gates. (This is true even for a post...
That is, for all probabilistic polynomial time algorithm G, there exists a negligible function F such that ∣P[G(xQR,N)= 1]−P[G(xQ¯R,N)= 1]∣≤ F(k) where k is the security parameter, xQR is in QR, xQ¯R is in Q¯R and P is the probability finding function. 2.5...
Since this problem is a generalization of the satisfiability problem for propositional calculus it is immediately NP-hard. We show that it is NP-complete even when there are at most two literals per clause (a case which is polynomial-time solvable in the non-probabilistic case). We use ...
there is no known polynomial time algorithm for performing them exactly. Fortunately, a number of approximate integration algorithms have been developed, including Markov chain Monte Carlo (MCMC) methods, variational approximations, expectation propagation and sequential Monte Carlo23–26. It is worth not...
Polynomial-time algorithms for testing probabilistic bisimulation and simulation R. Alur, T.A. Henzinger (Eds.), Proceedings of the Eighth International Conference on Computer Aided Verification, LNCS, volume 1102, CAV, New Brunswick, NJ, USA (1996), pp. 50-61 View at publisherCrossrefGoogle ...
Tzeng, W.-G.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput. 21(2), 216–227 (1992) Article MathSciNet MATH Google Scholar Ron, D., Singer, Y., Tishby, N.: Learning probabilistic automata with variable memory length. In: Proceedings of the...
如果在O(n)步后没有找到满意的分配,则重新开始。我们的分析表明,对于任何具有n个变量的可满足k-CNF 公式,此过程平均仅需重复t次就能找到可满足的分配,其中t是(2(1−1/k)n)的多项式因子(polynomial factor)。这是迄今为止已知的最快(也是最简单)的 3-SAT 算法。
A polynomial time algorithm for testing dianosability of discrete event systems IEEE Trans. Autom. Control (2001) Kautz, H., Selman, B., 1996. Pushing the envelope: planning, propositional logic, and stochastic search. In:... There are more references available in the full text version of ...
Probabilistic Polynomial-Time Turing Machine Probabilistic Prefix Tree Acceptor Probabilistic Principle Component Analysis Probabilistic Program Dependence Graph Probabilistic Quantitative Precipitation Estimation probabilistic quantitative precipitation forecast Probabilistic Quantitative Snowfall Forecast Probabilistic Radial Bas...