polynomial computational time complexity
Bayesian bin distribution inference and mutual information
... model complexity can be determined completely from the data in a computational time that is linear in the number of degrees of freedom and quadratic in the number of possible values of ...
14
Computational Complexity of Weighted Threshold Games
... pseudopolynomial time algorithm for computing the Shapley value by dynamic programming (Garey & John- son 1990; Matsui & Matsui ...in polynomial time, and that the nucleolus can be computed ...
6
Computational Complexity: A Modern Approach
... p9.2 (160) 9.1. PERFECT SECRECY AND ITS LIMITATIONS Research on modern cryptography led to significant insights that had impact and applications in complexity theory and beyond that. One is the notion of ...
26
The Computational Complexity of Linear Optics
... of complexity theory, it is no means settled that factoring is classically ...of complexity classes or other disastrous theoretical ...the polynomial hierarchy would collapse, or some other “generic, ...
110
Practical polynomial factoring in polynomial time
... a polynomial time complexity bound but was not the algorithm of choice for most computer algebra systems as Zassenhaus was more practical for the majority of everyday ...of computational ...
9
Polynomial time solutions of computational problems in noncommutative-algebraic cryptography
... the polynomial time cryptanaly- ...the complexity contributed by the field ...the complexity comes from the Lawrence–Krammer representation having dimension quadratic in N ...
20
The computational complexity of polynomial factorization. organized by Shuhong Gao, Mark van Hoeij, Erich Kaltofen, and Victor Shoup.
... [Hoeij02] van Hoeij, Mark. Factoring polynomials and the knapsack problem. J. Number Theory, 95:167–189, 2002. Implementation available at http://web.math.fsu.edu/∼hoeij/. [Ka82:focs] Kaltofen, E. A ...
5
On uncertainty principle of the local polynomial Fourier transform
... contain time-varying frequencies, we can use a smaller number of the polynomial coefficients in the LPFT to approxi- mate the frequency contents of the signal ...of polynomial coefficients to be ...
13
QoE-Driven Mobile Edge Caching Placement for Adaptive Video Streaming
... Abstract—Caching at mobile edge servers can smooth temporal traffic variability and reduce service load of base stations in mobile video delivery. However, the assignment of multiple video representations to distributed ...
16
The Computational Complexity of Untrapped Choice Procedures
... In this paper, we define two versions of Untrapped set (weak and strong Un- trapped sets) over a finite set of alternatives. These versions, considered as choice procedures, extend the notion of Untrapped set in a more ...
10
Practical Polynomial Factoring in Polynomial Time
... a polynomial time complexity bound but was not the algorithm of choice for most computer algebra systems as Zassenhaus was more practical for the majority of everyday ...of computational ...
8
Learning Factor Graphs in Polynomial Time and Sample Complexity
... the computational and sample complexity of parameter and structure learning in graphical ...in polynomial time and from a polynomial number of training examples, assuming that the data ...
46
Can Fractional Calculus be Generalized: Problems and Efforts
... The classical differential equations viz. the integer order differential equations both ordinary and partial also pervades not only almost the whole of science and engineering applications but also the whole of ...
42
Expressibility of higher order logics on relational databases : proper hierarchies : a dissertation presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Systems at Massey University, Wellington, New Zealand
... My Friends in Argentina have always been with me through these years. They never complained for the long periods of silence on my part. Thanks are due to them for receiving me each time I went back and making me ...
151
An intrusive approach to uncertainty propagation in orbital mechanics based on Tchebycheff polynomial algebra
... of basis functions providing that the corresponding algebraic rules between monomials can be de- fined. The idea of a more generic TPSA dates back at 1982 7 with the name of Ultra Arithmetic. However in 2003 8 the ...
16
On the Computational Complexity of the Domination Game
... notation set n = |V (G)| and m = |E(G)|. Using the standard BFS, the spheres around each vertex can be determined in time O(m). Hence, the first loop of the algorithm can be performed in O(nm) time. If ...
8
A reduction of Semigroup DLP to classic DLP
... in polynomial time, to the DLP in a subgroup G of ...subexponential time algorithm for the DLP in subgroups of S (which is the case, for example, when S is a semigroup of matrices over a finite ...
8
A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal
... similar to the conventional NSAF. In addition, the proposed algorithm has lower computational complexity than NSAF due to the signed regressor of the input signal at each subband. The theoretical ...
23
Reducing Complexity of Pairing Comparisons using Polynomial Evaluation
... Bilinear pairings is an interesting topic in cryptographic research. There is a great number of cryptographic protocols that use bilinear pairing comparisons as their core components and their versatility is without the ...
7
An Efficient FPGA-based Frequency Shifter for LTE/LTE-A Systems
... The Physical Random Access Channel (PRACH) plays an important role in LTE and LTE-A systems. It is through the PRACH channel that the user equipment (UE), based on eNodeB’s timing estimates, aligns its uplink ...
27