Zhu. Exponential and polynomial time algorithms for the minimum common string partition problem. In W. Wang, X. Zhu, and D.-Z. Du, editors, Proceedings of COCOA 2011 - 5th International Conference on Combinatorial Optimization and Applications, volume 6831 of Lecture Notes in Computer Science, ...
21 、To this day, researchers have found only a few other quantum algorithms that appear to provide a speedup from exponential topolynomialtime for a problem.───到目前为止,研究人员只找到少数的量子演算法,可以将一个问题的计算所需时间,由指数时间降到多项式时间。 22 、Theorem 3.3 Algorithm 2 is...
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially
They choose different polynomials for different distributions to obtain the exponential convergence of approximation ability. Because the various operations of polynomial are quite cheap, compared to the MC method. So it has been rapidly popularized. Moreover, as a basis function in the second-order ...
4 The Morris Orientations Morris proved that under R = RANDOMEDGE, Algorithm 3.1 may be forced to per- form an expected exponential number of iterations [24]. More precisely, at least ((n − 1)/2)! iterations are required on average to find the sink of the n-cube USO generated (...
Polynomial, Exponential and Approximate Algorithms for Metric Dimension ProblemBadr, ElsayedEl-hay, Atef AbdAhmed, HagarMoussa, MahmoudInternational Journal of Mathematical Combinatorics
Exponential-time algorithmForestRegular graphTutte polynomialUnit interval graphWe prove #P-completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O{sup}* (1:8494{sup}m) time for 3-regular graphs, and O{sup...
A. I. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply expo- nential factor, Random Structures & Algorithms , 14 (1999), 29-61.Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor. ...
Main lifetime computing algorithms can be classified as exponential pattern retrieve and polynomial fitting procedure. Especially, a novel lifetime computing method based on bi-exponential decay has been discussed. In experiment, we have validated the proposed algorithms utilizing synthetic imag...
exponential loss in security and we will be modifying this construction to achieve our goal of relying only on polynomially hard\mathsf {FE}scheme. For this step, we rely on the techniques built by Garg et al. in [GPS15,GPSZ16] to avoid the exponential loss in security reduction. Parts ...