Sentence examples for the problem of determining whether from inspiring English sources

In this paper, we consider the problem of determining whether a given graph is a maximal planar graph or not.

Fourth, the problem of determining whether animals are conscious stretches the limits of knowledge and scientific methodology (beyond the breaking point, according to some).

The problem of determining whether or not an instance (G,s,t) of a Hamilton path problem has a solution is NP-complete.

The first of these three papers considers the problem of determining whether a comparability graph has a transitive orientation with specified sources and sinks.

In particular, we formalise and study the problem of determining whether a given data integration system discloses a source query to an attacker.

The problem of determining whether a call chain is type infeasible is defined and exemplified, and a key property characterizing type infeasible call chains is described.

Leaving aside the problems of determining whether there has been a gain and, if so, of attributing it to the legislation, note the question the Center on Education Policy did not even address: What side effects did the law produce?

But it is known that the problem of determining graph automorphisms is equivalent to check whether two graphs are isomorphic [71].

Leibniz's argument is clever at the outset: he bypasses the thorny problem of determining whether Newton's idea of absolute space commits him to thinking of space as a substance a view, incidentally, which Newton explicitly considers and rejects in De Gravitatione (Newton 2004: 21 2)—by presupposing only that Newton thinks of space as existing independently of objects and their relations.

For the clinically important problem of determining whether a given primary tumor will metastasize, tree level features show improved prediction accuracy by at least 3.5% over all other feature sets considered, including comparable feature sets from the earlier unweighted models.

In fact, even just the cluster containment problem of determining whether a given cluster C is represented by some given network N, is already NP-complete, see (Kanj et al., 2008).