Keywords: پیچیدگی چند جمله ای; Discrete event systems (DES); Petri nets; Siphon computation; Deadlock; Problem decomposition; Polynomial complexity;
مقالات ISI پیچیدگی چند جمله ای (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: پیچیدگی چند جمله ای; Linear optimization; Kernel function; Interior-point algorithm; Large-update; Polynomial complexity
Keywords: پیچیدگی چند جمله ای; Scheduling; Workflow applications; Energy minimization; Fault tolerance; Throughput maximization; Polynomial complexity
A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
Keywords: پیچیدگی چند جمله ای; Convex quadratic semidefinite optimization; Interior point methods; Short-step primal-dual algorithms; Polynomial complexity;
Polynomial convergence of Mehrotra-type prediction–corrector infeasible-IPM for symmetric optimization based on the commutative class directions
Keywords: پیچیدگی چند جمله ای; Euclidean Jordan algebra; Symmetric optimization; Interior-point methods; Mehrotra-type algorithm; Polynomial complexity
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
Keywords: پیچیدگی چند جمله ای; Interior-point methods; Convex quadratic optimization; Euclidean Jordan algebras; Small-update method; Polynomial complexity;
Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
Keywords: پیچیدگی چند جمله ای; 14E15; 52C45; 14M25; 68Q25Nash blowings up; Binomial varieties; Desingularization; A priori bound; Euclidean multidimensional algorithm; Polynomial complexity
Approximation algorithm for estimating failure probability of multipath transmission
Keywords: پیچیدگی چند جمله ای; Computer network; Multipath transmission; Approximation; Polynomial complexity; Error bound;
A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
Keywords: پیچیدگی چند جمله ای; Semidefinite programming; Full Nesterov–Todd steps; Infeasible interior-point methods; Polynomial complexity; Kernel functions
A full-Newton step O(n)O(n) infeasible-interior-point algorithm for linear complementarity problems
Keywords: پیچیدگی چند جمله ای; Linear complementarity problems; Feasible interior-point method; Infeasible interior-point method; Polynomial complexity
Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
Keywords: پیچیدگی چند جمله ای; Linear complementarity problems; Interior point methods; Primal-dual algorithms; Polynomial complexity; Numerical implementation;
A polynomial algorithm for recognizing the AmAm-order class
Keywords: پیچیدگی چند جمله ای; AmAm-orders; Recognition algorithm; Polynomial complexity; Preemptive scheduling
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT
Keywords: پیچیدگی چند جمله ای; One-in-three SAT; Clausal graph; Polynomial complexity; Nondeterministic polynomial complexity; NP-complete
Exploring complexity of large update interior-point methods for Pâ(κ) linear complementarity problem based on Kernel function
Keywords: پیچیدگی چند جمله ای; Linear complementarity problem; Primal-dual interior-point method; Kernel function; Proximity function; Large updates method; Polynomial complexity;
Primal–dual interior-point algorithms for second-order cone optimization based on kernel functions
Keywords: پیچیدگی چند جمله ای; 60K05; 90C51Second-order cone optimization; Interior-point methods; Primal–dual method; Large- and small-update methods; Polynomial complexity
An efficient approximation algorithm for counting n-cycles in a graph
Keywords: پیچیدگی چند جمله ای; Number of n-cycles; Graph theory; Approximation; Polynomial complexity; Error bound
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Keywords: پیچیدگی چند جمله ای; Linear optimization; Infeasible interior point methods; Self-regular functions; Adaptive large update; Polynomial complexity
Postponing the choice of the barrier parameter in Mehrotra-type predictor–corrector algorithms
Keywords: پیچیدگی چند جمله ای; Linear optimization; Predictor–corrector method; Mehrotra-type algorithm; Polynomial complexity; Superlinear convergence
Polynomial time second order Mehrotra-type predictor-corrector algorithms
Keywords: پیچیدگی چند جمله ای; Linear optimization; Predictor-corrector methods; Interior point methods; Second order methods; Polynomial complexity;
Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
Keywords: پیچیدگی چند جمله ای; Linear optimization; Primal-dual interior point method; Kernel function; Proximity function; Large update method; Polynomial complexity;