isomorphism/non-isomorphism同构/非同构 3)Non-morphological isomorphism非同素同构 4)non-isomorphic configuration非同构构形 1.As the module increases,thenon-isomorphic configurations increase exponentially.可重构模块机器人系统具有多种构形来适应环境和任务的要求,其非同构构形的数量随着模块数量的增加呈指数增长。
J.T. Schwartz, Non-isomorphism of a pair of factors of type III, Comm. Pure Appl. Math. 16(1963), 111-120.Non-isomorphism of a pair of factors of type III - Schwartz - 1963 () Citation Context ...K is isomorphic to the abelian subgroup H. Then G is an extension of an abelian...
nonisomorphism是什么意思_nonisomorphism用英语怎么说_nonisomorphism的翻译_nonisomorphism翻译成_nonisomorphism的中文意思_nonisomorphism怎么读,nonisomorphism的读音,nonisomorphism的用法,nonisomorphism的例句 nonisomorphism 翻译 非同构 以上结果来自机器翻译。
必应词典为您提供graph-non-isomorphism的释义,网络释义: 图形非同构;图的非同构;
Non isomorphism and miscibility in the solid state: determi- nation of the equilibrium phase diagram n- octadecane C18 + n-nonadecane C19. Mol. Cryst. Liq. Cryst. 1996, 281, 279-290.Robles, L.; Mondieig, D.; Haget, Y.; Cuevas-Diarte, M. A.; Alcobe, X. Non Isomorphism and ...
Isomorphisms and Non-Isomorphisms of Graph Models In the paper the existence or non-existence of isomorphic mappings between graphmodels for the untyped lambda calculus is studied. It is shown that Engeler... H Schellinx 被引量: 0发表: 1990年 Isomorphisms and nonisomorphisms of symplectic gro...
2014. "Satisfiability allows no nontrivial sparsification unless the polynomial-Time hierarchy collapses." Journal of the ACM 61 (4). doi:10.1145/2629620.Klivans, A. R., and van Melkebeek, D., ``Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses,'...
We then show the extent to which the characteristic polynomials of the perturbed graphs can be used in determining whether two graphs are non-isomorphic. 展开 关键词: Non-isomorphism of graphs characteristic polynomial reconstruction conjecture graph perturbation ...
The discussion of the zero-knowledge proof protocol of the nonisomorphism of graphs (GNI) has appeared in many papers, but they are not complete zero-knowledge proof protocols at all. This paper proposed a complete zero-knowledge proof protocol on the pr
Non-reversibility and self-joinings of higher orders for ergodic flows By studying the weak closure of multidimensional off-diagonal self-joinings, we provide a sufficient condition for non-isomorphism of a flow with its inver... K Fr?Czek,J Ku?Aga-Przymus,M Lemańczyk - 《Journal Danalys...