小窓モード

プレミアム

ログイン
設定

設定

「problem」の共起表現一覧(1語右が「can」)

該当件数 : 39



This problem can be fixed.
This problem can lead to data inconsistency.
Almost any boolean reasoning problem can be expressed as a SAT problem.
The problem can easily be extended to higher dimensions.
The NP-completeness of the decision problem can be shown using a reduction from the Hamil
pi) and c(qj) are positive, this maximization problem can be formulated as a minimization problem i
from which the problem can be solved using the method of the last mu
The expression problem can be treated as a use case in programming l
The problem can also be generalized to n points in the d-
This problem can arise in situation that liquid material i
The problem can be relatively easily eliminated by making
For the case of dust, the problem can be solved by using the Bianchi identities
hat it is just as absurd to assume that every problem can be solved.
The derivatization problem can be resolved by cleaving large peptides in
be used together with the floor function, the problem can be solved in O(n) time.
r function is computable in constant time the problem can be solved in O(n log log n) time.
model is that no part of the solution of the problem can be perpetuated "upstream".
be the set of equipments purchased, then the problem can be formulated as,
On some occasions, this problem can be fixed by using the Update Service soft
rgy the child previously put into the Oedipal problem can be used for developing the self.
This problem can be avoided either by incorporating sand o
By the second definition, any decision problem can be shown to be decidable by exhibiting an
This problem can be rectified by deriving the force law fr
This problem can be alleviated by testing a random non-exi
ht construction of an automaton such that the problem can be answered.
This problem can be solved by using CT with 1 ampere secon
e literature is limited, but some idea of the problem can be gained from past small scale studies.
They began by noting that the Generals' Problem can be reduced to solving a "Commander and Li
Any algorithm for the widest path problem can be transformed into an algorithm for the
The trans-Planckian problem can be conveniently considered in the framewo
More generally, the yo-yo problem can also refer to any situation where a perso
This problem can be minimized by using methods that correc
The birthday problem can be generalized as follows: given n random
The boolean satisfiability problem can be viewed as the special case where all v
This problem can be mitigated, however, by deploying an ap
For the septum primium, the problem can arise as a result of excess resorption of
ement covering all aspects of the Middle East problem can be reached."
of Ω(n log n) for time complexity of the EMST problem can be established in restricted models of co
plexity class NP in the sense that a decision problem can be expressed in existential second-order
                                                                                                   


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2024 GRAS Group, Inc.RSS