Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
complete redundancy - перевод на русский
FINANCIAL INCENTIVE OFFERED BY AN ORGANISATION TO ENCOURAGE EMPLOYEES TO VOLUNTARILY RESIGN
Voluntary Redundancy; Redundancy contract
Найдено результатов: 467
complete redundancy
нефтегазовая промышленность
полное резервирование
cyclic redundancy check
TYPE OF HASH FUNCTION USED TO DETECT ERRORS IN DATA STORAGE OR TRANSMISSION
Cyclic Redundancy Check; FCS-32; Cyclic redundancy code; CRC16; Crc64; Crc32 mpeg2; Crc16; Cyclic redundancy checks; CRC-24; CRC-16; CRC-8; CRC-64; Cyclical redundancy checking; CRC-CCITT; CRC-12; Crc32c; CRC32c; CRC8; Cyclic redundancy; Cyclic redundancy checksum; CRC-32C; CRC-32K; CRC check; CRC Values; Polynomial representations of cyclic redundancy checks; Polynomial CRC representations; List of CRC polynomials
см. CRC
tetrahedral graph
![Two tetrahedra in a cube]]](https://commons.wikimedia.org/wiki/Special:FilePath/CubeAndStel.svg?width=200 "Two tetrahedra in a cube]]")
![[[Compound of five tetrahedra]]](https://commons.wikimedia.org/wiki/Special:FilePath/Compound of five tetrahedra.png?width=200 "[[Compound of five tetrahedra]]")
![[[Compound of ten tetrahedra]]](https://commons.wikimedia.org/wiki/Special:FilePath/Compound of ten tetrahedra.png?width=200 "[[Compound of ten tetrahedra]]")
SIMPLE UNDIRECTED GRAPH IN WHICH EVERY PAIR OF DISTINCT VERTICES IS CONNECTED BY A UNIQUE EDGE
Full graph; Complete Digraph; Complete digraph; K n; Tetrahedral Graph; Complete graphs
математика
тетраэдральный граф
complete graph
SIMPLE UNDIRECTED GRAPH IN WHICH EVERY PAIR OF DISTINCT VERTICES IS CONNECTED BY A UNIQUE EDGE
Full graph; Complete Digraph; Complete digraph; K n; Tetrahedral Graph; Complete graphs
теория графов
полный граф
complete quadrangle
FOUR POINTS THAT DETERMINE SIX DISTINCT LINES
Tetrastigm; Complete quadrilateral
геометрия
полный четырёхугольник
complete quadrilateral
FOUR POINTS THAT DETERMINE SIX DISTINCT LINES
Tetrastigm; Complete quadrilateral
геометрия
полный четырёхугольник
complete variety
TYPE OF ALGEBRAIC VARIETY
Completeness of projective varieties; Complete algebraic variety
математика
полное многообразие
NP-complete problem
![Levin]] proved that each easy-to-verify problem can be solved as fast as SAT, which is hence NP-complete.](https://commons.wikimedia.org/wiki/Special:FilePath/3SAT 17 svg.svg?width=200 "Levin]] proved that each easy-to-verify problem can be solved as fast as SAT, which is hence NP-complete.")
![P≠NP]], while the right side is valid under the assumption that P=NP (except that the empty language and its complement are never NP-complete, and in general, not every problem in P or NP is NP-complete)](https://commons.wikimedia.org/wiki/Special:FilePath/P np np-complete np-hard.svg?width=200 "P≠NP]], while the right side is valid under the assumption that P=NP (except that the empty language and its complement are never NP-complete, and in general, not every problem in P or NP is NP-complete)")
![reductions]] typically used to prove their NP-completeness](https://commons.wikimedia.org/wiki/Special:FilePath/Relative NPC chart.svg?width=200 "reductions]] typically used to prove their NP-completeness")
COMPLEXITY CLASS
NP-complete problem; NP-complete problems; NP complete; NP completeness; NP-C; Np complete; Np-complete; NP-complete language; Np-complete problem; NP-Completeness; Np completeness; Non-deterministic polynomial-time complete; NP-Complete; Nondeterministic Polynomial Complete; Non polynomial complete; Np-Complete; NP-complete; NP-incomplete
полная задача, переборная задача, полиномиально разрешимая на недетерминированных машинах
NP-completeness
COMPLEXITY CLASS
NP-complete problem; NP-complete problems; NP complete; NP completeness; NP-C; Np complete; Np-complete; NP-complete language; Np-complete problem; NP-Completeness; Np completeness; Non-deterministic polynomial-time complete; NP-Complete; Nondeterministic Polynomial Complete; Non polynomial complete; Np-Complete; NP-complete; NP-incomplete
NP-полнота
body of work
![Title page from a 1739 volume of the ''Opera Omnia'' of [[Bernardino Ramazzini]]](https://commons.wikimedia.org/wiki/Special:FilePath/Opera Omnia.jpg?width=200 "Title page from a 1739 volume of the ''Opera Omnia'' of [[Bernardino Ramazzini]]")
COLLECTION OF ALL THE WORKS OF ONE ARTIST, WRITER, SCIENTIST, MUSICIAN, GROUP, ETC.
Omnia opera; Body of work; Opera Omnia; Body of Work; Collected edition; Opera omnia; Complete Works; The complete works; Essay collection; The Complete Works
главная [основная] часть книги (без предисловия и приложений)
Определение
complete graph
A graph which has a link between every pair of nodes. A
complete bipartite graph can be partitioned into two subsets
of nodes such that each node is joined to every node in the
other subset.
(1995-01-24)
Википедия
Voluntary redundancy
Voluntary redundancy (VR) is a financial incentive offered by an organisation to encourage employees to voluntarily resign, typically in downsizing or restructuring situations. The purpose is to avoid compulsory redundancies or layoffs.
