Sentence examples for complexity assumption from inspiring English sources

It shows that the above extended complexity assumption still holds in the generic group model by employing the same proof technology introduced in [11].

CB-FMT has slightly better in-band/out-band power ratio due to a higher sub-channel frequency selectivity w.r.t OFDM, under comparable complexity assumption.

A recent paper by Heijltjes and Houston (2014) has shown that there can be no satisfactory notion of proof nets for MLL with units (under current complexity assumptions).

Polynomial time algorithms to find good approximate solutions to either problem most likely do not exist (under certain complexity assumptions), but a time efficient approximation algorithm is shown that solves a special case of these problems.

The Set Cover problem belongs to a group of hard problems which are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions.

We show that for most of the considered problems, task (i) admits a polynomial-time preprocessing to a problem kernel whose size is polynomial in a structural problem parameter of the input, in contrast to task (ii) which does not admit such a reduction to a problem kernel of polynomial size, subject to a complexity theoretic assumption.

Given the fact that there is no apparent relationship between the gene number and organismal complexity, the assumption that modern vertebrates have attained higher level of complexity in their body plans by expanding their genetic toolkit through big-bangs of genome amplification events is not credible.

Plug-in approaches simplify predictor design complexity using assumptions about the observation generating mechanism to achieve optimal predictor design.

For a given question posed, utilizing a range of models with varying complexity and assumptions can provide a deeper understanding of the answers derived from models.

When talking about complexity, the assumptions of no recombination and of fixed length are presumably rather strong, and one would like to see them reduced in the future.

For deciding e.g. skeptical acceptance of an argument under preferred semantics one requires in general an exponential number of calls to the SAT solver (under standard complexity theoretic assumptions).