Sentence examples for establishing the complexity of from inspiring English sources

Thus his skills at establishing the complexity of a single character through subtle and inspired use of detail and nuanced shades of feeling seemed, especially after the completion of Anna Karenina in 1877, to come second to his need to change the world.

The problem found itself greatly connected to the growing interest of computer scientists in establishing the complexity of temporal logics, and more specifically of the (propositional) modal μ-calculus (MMC) due to Kozen [1983], because RPDL has a linear blow-up translation to MMC.

In this paper, we establish the complexity of this two-memory scheduling problem, and provide inapproximability results.

However, improvements in environmental sensors over the last 20 years have established the complexity of desert climates and the importance of microclimatic controls and allowed considerable refinement of experimental design.

As Mans et al. [10] acknowledged, this makes it difficult to unambiguously establish the complexity of the NPC in the Last Eukaryotic Common Ancestor (LECA), since inferences are dependent upon the position of the root of the eukaryote tree.

The chapter begins with a set of questions to establish the complexity and challenges of this form of drug delivery.

The next result presents an upper bound for the second derivative of f 1 which is usable for establishing the polynomial complexity of the algorithm.

We establish the computational complexity of the FFDCJ-DISTANCE problem by means of a polynomial time and approximation preserving (AP-) reduction from the problem (1,2)- EXDCJ-DISTANCE, which is NP-hard [ 8].

To this end, we introduce a generic framework for measuring the degree of envy in a society and establish the computational complexity of checking whether a given scenario allows for a deal that is beneficial to every agent involved and that will reduce overall envy.

While the general theory is well established, the mathematical complexity of the problem so far prevents widespread use of these techniques in practical studies.

Nesterov and Todd [11] proposed first this kind of an optimization problem under the name of convex programming for self-scaled cones and established the polynomial complexity of the primal-dual interior point method using the so-called NT (Nesterov-Todd) direction [12].