「non-trivial」の共起表現一覧(1語右で並び替え)

non-trivial

1語右で並び替え

該当件数:32件

  • However, if M is topologically nontrivial, A and B can have nontrivial solutions globa
  • The only nontrivial and useful perfect codes are the distance-3
  • one, more often than not, the congruence is nontrivial and the factorization is complete.
  • fers to cactus graphs, graphs in which every nontrivial biconnected component is a cycle.
  • t contain certain byte values and requires a nontrivial combination of escaping and delimiting, whil
  • n element c ≤ b such that c ≠ 0 and c has no nontrivial common predecessor with a.
  • This was an early example of a nontrivial duality of categories.
  • aps with disconnected Julia sets may display nontrivial dynamics.
  • Axiom I1: There is a nontrivial elementary embedding of Vλ+1 into itself.
  • Axiom I3: There is a nontrivial elementary embedding of Vλ into itself.
  • called η-extendible if for some λ there is a nontrivial elementary embedding j of
  • Axiom I0: There is a nontrivial elementary embedding of L(Vλ+1) into itself
  • Axiom I2: There is a nontrivial elementary embedding of V into a transitive
  • olic groups (with a few exceptions) having a nontrivial essential splitting over a virtually cyclic
  • Nonlinearities in f render this coupling nontrivial even in 3+1D.
  • hat the birth of a new person always entails nontrivial harm to that person, creating a moral impera
  • This term is only nontrivial in 4+1D or greater, and as such, only applie
  • It can be shown that, for nontrivial irreducible incidence matrices, flow equival
  • ach other if they are isomorphic because any nontrivial minor operation removes edges.
  • Phylogenetic trees among a nontrivial number of input sequences are constructed us
  • The desire to make new nontrivial predictions, for example, to provide possibl
  • e and his research group managed to solve a ' nontrivial' problem using DNA computation.
  • ies within loops, which is a significant and nontrivial problem, is tackled by loop dependence analy
  • -Karp-Rosenberg conjecture stating that many nontrivial properties in graph theory cannot be answere
  • In fact, they have a straightforward but nontrivial relationship; see Mathematical descriptions
  • ht has no free variables and is false in any nontrivial ring.
  • ften be used to prove existence of a second, nontrivial, solution.
  • d graph is acyclic if and only if it has no ( nontrivial) strongly connected subgraphs (because a cyc
  • (particularly because it covered groups with nontrivial torsion) than the original JSJ-decomposition