Theory of Computing SystemsCai, L., Fellows, M., Juedes, D., Rosamond, F., "The Complexity of Polynomial-Time Ap- proximation", Theory of Computing Systems 41:3 (October 2007), pp. 459-477.Cai, L., Fellows, M.,
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 ...
The issues of dwell time stability and stabilization of interval DSPLSs are investigated in this paper. Sufficient stability conditions have derived for primal and transpose interval DSPLSs with dwell time, and the conservatisms and complexity of these conditions have been compared. The comparison resu...
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 ...
The complexity of the algorithm can be expressed as O(n2) [18]. In order to solve the problem of automated guided vehicle (AGV) access path planning in the smart garage and overcome the shortcomings of the traditional Dijkstra algorithm such as high time complexity, large search range, and ...
provide the summary of the computational complexity classes of different self-suspending task models and systems (Sect. 8). Further, some results in the literature are listed in Sect. 9.1 with open issues that require further detailed examination to confirm their correctness. During the preparation ...
It must be observed that with the addition of this tighter constraint on the output (i.e. that it be T-depth optimal), there is a probability that the complexity of the problems change. For example, it was known that a quantum circuit can be synthesized in poly(2n) time, where 2n ...
This wavelength-dependent group velocity delay (dispersion) can be described by a polynomial function for the IRF location parameter, of which the parameters must be estimated (from the data, or from a separate measurement, e.g. of the cross-phase modulation [31]). 2.1.2 Stochastics The...
We also provide three special cases which can be solved by polynomial time algorithms. Highlight ► A new learning effect is introduced into single machine scheduling problems. ► The actual time-dependent and job-dependent model is a more general one. ► The complexity result of the ...
Another useful approach used to test the stability is the Hermite–Biehler criterion [51, 52], which can be considered as an algebraic criterion, which expresses the stability in terms of even and odds parts of the characteristic polynomial. A pair of polynomials u and v are said to be a ...