new polynomial-time algorithm
A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series
... Parts of this work have appeared previously in [32]. However, this manu- script describes algorithmic and complexity details not included in the con- ference version of the paper. We also present a detailed comparison ...
39
Clique cover and graph separation : new incompressibility results
... an algorithm solving any instance ( x, k ) in time f ( k )poly(| x |) for some (usually exponential) computable function f ...a polynomial time preprocessing routine that takes an instance ( ...
21
Practical polynomial factoring in polynomial time
... our algorithm is useful in practice and give direct evidence that our approach can fac- tor successfully at a lower level of p-adic precision than the previous standard based on the Landau-Mignotte ...an ...
9
An improved polynomial time algorithm for computing the refined Buneman tree
... in polynomial time, whereas most other methods are ...a new and promising approach to phylogeny reconstruction [6, 7, 18, 19]: rst compute a tree containing only safe edges through one of the above ...
12
Probabilistic & Statistical Methods in Cryptology An Introduction by Selected Topics pdf
... computing time on up to 120 machines was ...A new direction of cryptanalysis would be the possible use of quantum com- puters istead of classical Turing ...number) time! So in this case, the RSA and ...
159
Exact Polynomial time Algorithm for the Clique Problem and P = NP for Clique Problem
... Sweeper Algorithm. Section 2 presents a new general algorithm to solve the Clique problem for an arbitrary undirected ...general algorithm has been analysed and finally P=NP for Clique problem ...
5
A polynomial time algorithm for computing the area under a GDT curve
... of new and improved algorithms for measuring the quality of protein ...no algorithm currently exists that is capable of computing accurate estimates of ...
8
A Polynomial Time Dynamic Programming Algorithm for Phrase Based Decoding with a Fixed Distortion Limit
... a polynomial-time dynamic program- ming algorithm for phrase-based decoding with a fixed distortion ...The algorithm uses a quite dif- ferent representation of states from previous decod- ing ...
14
A Polynomial Time Parsing Algorithm for TT MCTAG
... This paper investigates the class of Tree- Tuple MCTAG with Shared Nodes, TT- MCTAG for short, an extension of Tree Adjoining Grammars that has been pro- posed for natural language processing, in particular for dealing ...
9
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
... have time complexities O(n) [3, 6] and O ( √ n) [9], which are both exponential with respect to the binary encoded input length, the com- plexity of the new algorithm is O ¡ log 3 n ¢ ...solution ...
35
Synchronous Context Free Grammars and Optimal Parsing Strategies
... optimal time and space complexity. For time complexity, there is no benefit to considering parsing strategies that combine more than two subsets at a ...between time and space ...both time and ...
37
Key Recovery for LWE in Polynomial Time
... Our polynomial time key recovery attack should be viewed in the context of the known attacks on search-LWE, namely the embedding attack [LM09, BG14] and the enumeration attacks [LP11, LN13, ...BKZ-2.0 ...
16
Efficient Rounding for the Noncommutative Grothendieck Inequality
... rounding algorithm corresponding to ...The algorithm modeled on Kaijser’s proof is interesting in its own right, and seems to be versatile and applicable to other problems, such as possible non-bipartite ...
39
Enhanced Security of Attribute-Based Signatures
... SimSign algorithm for this construction is similar to the one that we used above for ...signature algorithm Sign that on input (m, P ) and a secret key sk first extends the policy to P 0 := P ∨ ...
32
Indistinguishability Obfuscation from Compact Functional Encryption
... running time of the encryption algorithm must only be a polynomial in the security parameter and the input message length (and not in the function description size or its output ...
57
multicast-ton.pdf
... Theoretically, we show that it is highly unlikely that there exists a polynomial-time algorithm with a performance guarantee of constant times optimum cost, introduce metrics for mea[r] ...
11
Polynomial time primality testing algorithm
... Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 2006 Polynomial time primality testing algorithm Takeshi Aoyama Follow this and additional work[r] ...
71
An adaptive polynomial based forward prediction algorithm for multi-actuator real-time dynamic substructuring
... Synchronisation subspace plots are used to show the effectiveness of the con- trol algorithm by plotting the desired verses actual responses, (Ashwin 1998). A subspace plot shows the amplitude accuracy and the ...
21
List-Decoding Multiplicity Codes
... decoding algorithm which when given access to a corrupted version of E (m), finds any given symbol of the original message ...length polynomial in the length of the code. Thus the sublinear time ...
34
A new inequality for a polynomial
... a polynomial of degree n, having no zeros in | z | < k, k ≥ 1, then it has been shown that for R > 1 and | z | = 1, | p(Rz) − p(z) | ≤ (R n − 1)(1 + A t B t k t+1 )/(1 + k t+1 + A t B t (k t+1 + k 2t ))max | ...
6