In fact, amongst the PTASs that are currently known, for an error of 20%, polynomial-time bounds no better than O(n 2000 ) are quite common. Viewing k = 1/ε as a problem parameter, in the sense of parameterized complexity, leads naturally to the question of whether an efficient PTAS...
The Computational Complexity of Tutte Invariants for Planar Graphs For each pair of algebraic numbers $(x,y)$, the complexity of computing the Tutte polynomial $T(G;x,y)$ of a planar graph G is determined. This computation... D Vertigan - 《Siam Journal on Computing》 被引量: 66发表:...
Afterwards, inspired by the polynomial time difference of convex functions (POTDC) method, we develop a sub-optimal solution which has lower complexity but... J Zhang,F Roemer,M Haardt - IEEE 被引量: 15发表: 2013年 Reliable Multi-Path Routing With Bandwidth and Delay Constraints Yang, "Pol...
Even an addition to \(F(\cdot )\) a linear function destroys the values of the barrier parameter. The main goal of this paper is to replace (3) by a more robust definition, which still gives us a possibility to prove polynomial-time complexity of interior-point methods....
The numerical constant of the leading terms in the polynomial expressions for both the run time and memory complexity is a function of the ratio k = p/r, which is the ratio of the number of local data paths to the number of registers in a circuit. To gain further insight into the ...
Learning of Cluster-based Feature Importance for Electronic Health Record Time-series [paper] ICLR 2022 Time Series Forecasting Pyraformer: Low-Complexity Pyramidal Attention for Long-Range Time Series Modeling and Forecasting [paper] [official code] DEPTS: Deep Expansion Learning for Periodic Time Seri...
In addition, a specific example is presented to illustrate the new algorithm. Lastly, we demonstrate its polynomial feature as well as its high efficiency. 展开 关键词: computational complexity dynamic programming integer programming matrix algebra quadratic programming NP-hard algorithm dynamic programming...
We present a deterministic algorithm where the average-case complexity is polynomial in the number of jobs when the known deterministic processing times of jobs are generated for each machine as nonnegative i.i.d. random variables from certain classes of distributions. The classes of distributions ...
Polynomial kernels for weighted problems J. Comput. System Sci. (2017) FellowsM.R. et al. Facility location problems: A parameterized view Discrete Appl. Math. (2011) FellowsM.R. et al. On the parametric complexity of schedules to minimize tardy tasks Theoret. Comput. Sci. (2003) Kha...
We will seek a truth assignment to maximize the number of satised clauses. This problem is NP -hard even for its restricted version, the 2-MAXSAT problem by which every clause contains at most 2 literals. In this paper, we discuss a polynomial time algorithm to solve this problem. Its ...