quasi-polynomial time algorithm
An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria
... polynomial time algorithm (quasi-PTAS), for any constant ε > 0 (Lipton, Markakis, and Mehta ...on polynomial time, then efficient algorithms exist only for ε ≥ ...a ...
7
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
... pseudo-quasi-polynomial time, we take a different ...pseudo-quasi-polynomial time and produce a strategy decomposition of Con’s winning ...pseudo-quasi- polynomial ...
11
Polynomial Calculation of Quasi Gray code labelings for Irregular Signal Constellations
... Switching Algorithm (BSA), which can pro- duce very good labelings, is non ...an algorithm based on hill climbing from many starting points to produce the assumed global ...rule-based algorithm based ...
12
A pseudo quasi polynomial algorithm for mean payoff parity games
... first algorithm that achieved an n o(d) running time. Its running time is polynomial O ( n 5 ) if d ≤ log n and quasipolynomial O(n lg d+6 ) in ...al.’s polynomial bound for d ≤ logn ...
11
An Adaptive Channel Estimation Algorithm Using Time Frequency Polynomial Model for OFDM with Fading Multipath Channels
... both time and ...the polynomial basis [8]. Borah and Hart [9, 10] used the time domain polynomial approximation while Luise et ...the time-frequency ...both time and frequency ...
13
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
ON CERTAIN GENERALIZED VOLTERRA –TYPE INTEGRAL EQUATIONS WITH QUASI POLYNOMIAL FREE TERM
... In this paper we investigate the solution of certain generalized Volterra-type integral equation with Quasi polynomial free term involving the generalized G-function of several variables. The equation is ...
9
Polynomial Time Parsing of Combinatory Categorial Grammars
... Hence the shared forest representation we build is polynomial with respect to the length of the input, n, despite the fact that the number of derivations trees could be exponential... We[r] ...
8
The general quasi order algorithm in number theory
... This paper deals with a generalization of the Binary Quasi-Order This generalization involves a more complicated algorithm than Some remarks are made on relative merits of two dual algor[r] ...
7
Consistent Feature Selection for Pattern Recognition in Polynomial Time
... We have also identified a different feature selection problem, that of discovering all relevant fea- tures ( ALL - RELEVANT ). This problem is much harder than MINIMAL - OPTIMAL , and has hitherto received little ...
24
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
A Polynomial Time Fragment of Dominance Constraints
... O(nm log n) (Galil et al., 1986). The match- ing algorithm itself is beyond the scope of this paper; for an implementation (in C++) see e.g. (Mehlhorn and N¨aher, 1999). Now let’s say that k is the maximum number ...
8
General Polynomial Time Decomposition Algorithms
... In this paper we present an extension of (and an improvement on) this result. We first define the general notion of an α-rate certifying q-set and show (with a simplified analysis) that it basically fits the same purpose ...
19
An adaptive polynomial based forward prediction algorithm for multi-actuator real-time dynamic substructuring
... To carry out a substructuring test the component of interest is isolated and fixed into an experimental test system. To link the substructure to the numerical models, a set of transfer systems (which act on the ...
21
Learning Factor Graphs in Polynomial Time and Sample Complexity
... a polynomial number of independence ...greedy algorithm will, in the infinite sample limit, identify a network structure which is a minimal I-map of the ...no polynomial time guarantees, but ...
46
Fixed dimensional energy games are in pseudo polynomial time
... Multi-Dimensional Energy Games are played turn-by-turn by two players on a finite multi-weighted game graph, whose edges are labelled with integer vectors modelling discrete energy consumption and refuelling. Player 1’s ...
13
Local polynomial method for ensemble forecast of time series
... observed time series lies well outside the forecast ensemble spread – explicitly ac- counting for forecast model error for each parameter combi- nation should inflate the ensemble spread in these ...geophysical ...
10
Polynomial Time Joint Structural Inference for Sentence Compression
... consider the fluency of the compressed sentence. Compared with TM13’s system, our model with exact decoding is not significantly faster due to the high order of the time complexity. On the oth- er hand, our ...
6
OCTAL: Optimal Completion of gene trees in polynomial time
... s adjacent to the newly created node. We then update A, the set of bipartitions for each tree, and the annotations of the edges of t and T as shared or unique. By Lemma 6, AddLeaf preserves all existing shared edges ...
18
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits
... sparse polynomial identity testing) they used a deterministic finite state automaton to isolate a monomial by designing an automaton which accepts a unique ...commutative polynomial is nonvanishing (because ...
36