Keywords: زمان چندجملهای; Bilevel programming; Continuous knapsack problem; Polynomial time;
مقالات ISI زمان چندجملهای (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: زمان چندجملهای; automatic web service composition; polynomial time; heuristic; planning; benchmark;
Keywords: زمان چندجملهای; Shortest path; Rerouting; Reconfiguration problem; Planar graph; Polynomial time; Dynamic programming;
Keywords: زمان چندجملهای; Stream programs; Type-2 functionals; Interpretations; Polynomial time; Basic feasible functionals; Computable analysis; Rewriting;
Keywords: زمان چندجملهای; String edit distance; String-to-string correction; Polynomial time
Keywords: زمان چندجملهای; Clique-width; Proper interval graphs; Polynomial time; Characterisation; Forbidden induced subgraphs
Keywords: زمان چندجملهای; 03D15; 03D20; 03E99; 68Q15Set function; Polynomial time; Cobham Recursion; Smash function; Hereditarily finite; Rudimentary function
Maximum weight independent set for âclaw-free graphs in polynomial time
Keywords: زمان چندجملهای; Maximum weight independent set problem; âclaw-free graphs; Polynomial time;
On sharing, memoization, and polynomial time
Keywords: زمان چندجملهای; Implicit computational complexity; Data-tiering; Polynomial time;
A type-based complexity analysis of Object Oriented programs
Keywords: زمان چندجملهای; Object Oriented Program; Type system; Complexity; Polynomial time;
4-coloring (P6,bull)-free graphs
Keywords: زمان چندجملهای; Coloring; P6-free; Bull-free; Polynomial time; Algorithm;
Wang’s B machines are efficiently universal, as is Hasenjaeger’s small universal electromechanical toy
Keywords: زمان چندجملهای; Polynomial time; Computational complexity; Small universal Turing machines; Wang’s B machine; Non-erasing Turing machines; Models of computation
Optimal cuts and partitions in tree metrics in polynomial time
Keywords: زمان چندجملهای; Computational complexity; Optimal cut; Optimal bisection; Tree metric; Geometric metric; Polynomial time
Arc-disjoint paths and trees in 2-regular digraphs
Keywords: زمان چندجملهای; Spanning tree; Out-branching; In-branching; Connected spanning subgraph; Mixed problem; Polynomial time; NP; 2-regular digraph
Convergence to approximate Nash equilibria in congestion games
Keywords: زمان چندجملهای; C72; Congestion games; Convergence to equilibrium; Approximate Nash equilibria; Best-response dynamics; PLS-completeness; Polynomial time; Symmetric congestion games;
Single-machine scheduling problems with the time-dependent learning effect
Keywords: زمان چندجملهای; Maximum lateness; Completion time; Learning effect; Scheduling; Polynomial time
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree
Keywords: زمان چندجملهای; Hypergraphs; Equal union property; L-matrices; Polynomial time; Turing reduction
Control structures in programs and computational complexity
Keywords: زمان چندجملهای; 03D15; 03D20; 68N15; 68N18; 68N30; 68Q15; 68Q17; 68W40; 03-02; Implicit computational complexity; Imperative programming languages; Grzegorczyk hierarchy; Higher type recursion; Lambda calculus; Polynomial time;
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Keywords: زمان چندجملهای; Horn Boolean formula; Conjunctive normal form; Satisfiability; Polynomial time;