CES 영어사전

Bijective

발음 발음 정보 없음 · 품사 형용사 (adjective)

가장 먼저 보는 뜻

한국어 뜻

검증된 한국어 뜻을 준비 중입니다. 확인되지 않은 자동 번역은 표시하지 않습니다.

영어 정의

(mathematics, of a function) Associating to each element of the codomain exactly one element of the domain; establishing a perfect (one-to-one) correspondence between the elements of the domain and the codomain; (formally) both injective and surjective..

의미별 영어 정의

  1. (mathematics, of a function) Associating to each element of the codomain exactly one element of the domain; establishing a perfect (one-to-one) correspondence between the elements of the domain and the codomain; (formally) both injective and surjective.
  2. (mathematics) Having a component that is (specified to be) a bijective map; that specifies a bijective map.

예문

1987, James S. Royer, A Connotational Theory of Program Structure, Springer, LNCS 273, page 15, Then, by a straightforward, computable, bijective numerical coding, this idealized FORTRAN determines an EN. (Note: In this FORTRAN example, we could have omitted restrictions on I/O and instead used a computable, bijective, numerical coding for inputs and outputs to get another EN determined by FORTRAN.)
1993, Susan Montgomery, Hopf Algebras and Their Actions on Rings, American Mathematical Society, CBMS, Regional Conference Series in Mathematics, Number 83, page 124, Recent experience indicates that for infinite-dimensional Hopf algebras, the “right” definition of Galois is to require that β be bijective.
2008, B. Aslan, M. T. Sakalli, E. Bulus, Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings, Joachim von zur Gathen, José Luis Imana, Çetin Kaya Koç (editors), Arithmetic of Finite Fields: 2nd International Workshop, Springer, LNCS 5130, page 131, Generally, there is a parallel relation between the maximum differential value and maximum LAT value for bijective S-boxes.
2012 [Introduction to Graph Theory, McGraw-Hill], Gary Chartrand, Ping Zhang, A First Course in Graph Theory, 2013, Dover, Revised and corrected republication, page 64, The proof that isomorphism is an equivalence relation relies on three fundamental properties of bijective functions (functions that are one-to-one and onto): (1) every identity function is bijective, (2) the inverse of every bijective function is also bijective, (3) the composition of two bijective functions is bijective.
An isomorphism is a bijective homomorphism.
Proving the conjecture is equivalent to constructing a PCP that reads 2 symbols and accepts iff these symbols satisfy a bijective constraint.

관련 단어

Bijective 사용 팁

bijective의 의미, 어조와 문법이 전체 문장에 맞을 때 사용하세요. 동의어라도 모든 문장에서 바로 바꿔 쓸 수 있는 것은 아닙니다.

이 단어 복습하기

자주 묻는 질문

bijective의 뜻은 무엇인가요?

현재 검증된 한국어 뜻은 준비 중이며 영어 정의는 “(mathematics, of a function) Associating to each element of the codomain exactly one element of the domain; establishing a perfect (one-to-one) correspondence between the elements of the domain and the codomain; (formally) both injective and surjective.”입니다.

bijective의 동의어는 무엇인가요?

문장 속 의미에 따라 가까운 동의어가 달라집니다.

bijective의 반의어는 무엇인가요?

정확한 반대말은 사용된 의미에 따라 달라집니다.

bijective를 문장에서 어떻게 쓰나요?

1987, James S. Royer, A Connotational Theory of Program Structure, Springer, LNCS 273, page 15, Then, by a straightforward, computable, bijective numerical coding, this idealized FORTRAN determines an EN. (Note: In this FORTRAN example, we could have omitted restrictions on I/O and instead used a computable, bijective, numerical coding for inputs and outputs to get another EN determined by FORTRAN.)

영어사전 출처

FreeDictionaryAPI.com / Wiktionary · 원문 출처 · CC BY-SA 4.0

영어사전 정보는 FreeDictionaryAPI.com이 제공하며 해당 서비스가 밝힌 Wiktionary 라이선스를 따릅니다.