Polynomial-time algorithm
Exact Polynomial time Algorithm for the Clique Problem and P = NP for Clique Problem
... Sweeper Algorithm”, a deterministic polynomial time algorithm for the problem of finding the maximum clique in an arbitrary undirected graph ...sweeper algorithm was made considering ...
5
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
... In this paper we have resolved an open question posed in [9] for the flow-shop batching problem with equal processing times and equal setup times, which is formulated as an integer non-linear programming problem of one ...
35
A polynomial time algorithm for reachability in branching VASS in dimension one
... lishing the P upper bound claimed in Theorem 2. In the first part, we consider a variation of the reachability problem in which we are only interested in reaching configurations that are sufficiently large and lie in a ...
14
A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree
... no polynomial time algorithm has been found for calculating the probability of a gene tree topol- ogy given a species tree under the multispecies coalescent ...in polynomial time, using ...
9
A polynomial time algorithm for computing the area under a GDT curve
... O(n 3 ) , where n represents the length of the protein model (and O hides the log factor). The algorithm returns “near- optimal” GDT_A scores, meaning that the errors in our estimates can be made arbitrary small ...
8
An improved polynomial time algorithm for computing the refined Buneman tree
... induce less than 1% incorrect edges [6, 18]); more importantly, because of the important constraints they impose on inferred edges, the corresponding tree can be computed in polynomial time, whereas most ...
12
A Polynomial Time Algorithm for Statistical Machine Translation
... The approach employs the stochastic bracketing transduction grammar SBTG model we recently introduced to replace earlier word alignment channel models, while retaining a bigram language [r] ...
7
Enhanced Security of Attribute-Based Signatures
... probabilistic polynomial-time algorithm SimSign that given just the master secret and message, computes the satisfying attribute set and appends it to the ...
32
The world of hereditary graph classes viewed through Truemper configurations
... a polynomial time algorithm that can find a 2χ(G)-coloring of a graph G ...exist polynomial time algorithms that find the chromatic number, C must have some “strong ...
49
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
Applying the Thorne Kishino Felsenstein model sequence evolution on a star shaped tree
... a polynomial-time algorithm for calculating the probability of three sequences that evolve on a tree (and more generally r sequences that evolve on a star-shaped tree) according to the ...
6
Towards a Fixed Parameter Tractability of Geometric Hitting Set Problem for Axis Parallel Squares Intersecting a Given Straight Line
... first polynomial time approximation schemes were proposed for unit and arbitrary axis-parallel squares, ...6-approximation polynomial time algorithm for the case of axis-parallel ...
5
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
Indistinguishability Obfuscation from Compact Functional Encryption
... running time of encryption algorithm has sublinear dependence on the function size, in fact, ...running time of the encryption algorithm on a message x must be at most poly(λ, |x|) · |f | 1− ...
57
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
Key Recovery for LWE in Polynomial Time
... Abstract. We discuss a higher dimensional generalization of the Hidden Number Problem and generalize the Boneh-Venkatesan method [BV96, Shp05] for solving it in polynomial time. We then use this to analyze ...
16
An adaptive polynomial based forward prediction algorithm for multi-actuator real-time dynamic substructuring
... AFP algorithm. Firstly, it can be seen that the substructuring algorithm has remained stable due to the high degree of synchronisation between the numerical models and their respective transfer sys- tems, ...
21
Efficient Rounding for the Noncommutative Grothendieck Inequality
... an algorithm which decomposes every (appropriately defined) “dense” matrix into a sum of a few “cut matrices” plus an error matrix that has small ...an algorithm that allows sub-constant ...
39
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
General Polynomial Time Decomposition Algorithms
... Another algorithm (related to but different from decomposition algorithms) is SimpleSVM (Vish- wanthan et al., 2003) which tries to iteratively include the support vectors in the working set. As- suming strict ...
19