fundamental polynomial - translation to ρωσικά
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

fundamental polynomial - translation to ρωσικά

ALGEBRAIC ENCODING OF GRAPH CONNECTIVITY
Dichromatic polynomial; Corank-nullity polynomial; Tutte–Whitney polynomial; Tutte-Whitney polynomial; Flow polynomial; Reliability polynomial

fundamental polynomial      

математика

фундаментальный многочлен

fundament         
WIKIMEDIA DISAMBIGUATION PAGE
Fundamtenal; Fundamentals; Fundamental (album); Fundament; Fundamental (disambiguation)

['fʌndəmənt]

существительное

общая лексика

зад

ягодицы

физико-географическая характеристика (региона)

зад, ягодицы

fundament         
WIKIMEDIA DISAMBIGUATION PAGE
Fundamtenal; Fundamentals; Fundamental (album); Fundament; Fundamental (disambiguation)
fundament noun зад, ягодицы

Ορισμός

fundamental
I. a.
Essential, primary, indispensable, radical, constitutional, organic, most important, principal.
II. n.
Leading principle, essential part, essential principle.

Βικιπαίδεια

Tutte polynomial

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is defined for every undirected graph G {\displaystyle G} and contains information about how the graph is connected. It is denoted by T G {\displaystyle T_{G}} .

The importance of this polynomial stems from the information it contains about G {\displaystyle G} . Though originally studied in algebraic graph theory as a generalization of counting problems related to graph coloring and nowhere-zero flow, it contains several famous other specializations from other sciences such as the Jones polynomial from knot theory and the partition functions of the Potts model from statistical physics. It is also the source of several central computational problems in theoretical computer science.

The Tutte polynomial has several equivalent definitions. It is equivalent to Whitney’s rank polynomial, Tutte’s own dichromatic polynomial and Fortuin–Kasteleyn’s random cluster model under simple transformations. It is essentially a generating function for the number of edge sets of a given size and connected components, with immediate generalizations to matroids. It is also the most general graph invariant that can be defined by a deletion–contraction recurrence. Several textbooks about graph theory and matroid theory devote entire chapters to it.

Μετάφραση του &#39fundamental polynomial&#39 σε Ρωσικά