必应词典为您提供covering-number的释义,un. 覆盖数;
1)covering number覆盖数 1.Let γ(G),β(G) and α(G) be the domination number, matching number and covering number of a graph G, respectively.我们分别用γ(G),β(G)和0α(G)表示图G的控制数、匹配数和覆盖数,对任意连通图,有γ(G)≤β(G)≤α(G)成立,1998年,Randerath和Volkmann给出了...
point covering number 英 [pɔɪnt ˈkʌvərɪŋ ˈnʌmbə(r)] 美 [pɔɪnt ˈkʌvərɪŋ ˈnʌmbər]网络 点覆盖数 ...
In 2007, Zhi-Wei Sun defined a covering number to be a positive integer L such that there exists a covering system of the integers where the moduli are distinct divisors of L greater than 1. A covering number L is called primitive if no proper divisor of L is a covering number. Sun ...
line-covering-number网页 图片 视频 学术 词典 航班 line covering number 美 英 un.线覆盖数 英汉 un. 1. 线覆盖数 隐私声明 法律声明 广告 反馈 © 2025 Microsoft
The covering number cn(G, C) is defined to be the minimal value of k such that Ck = G, or ∞ if no such k exists. Covering numbers have been studied in a variety of contexts, particularly for the case where G is a simple group and C a conjugacy class of G. For example, in ...
However, besides its own interest, it serves as a bridge between the kissing number and the covering number. This paper will review the basic problems and the main known results about these three numbers with an emphasis on their connections. In addition, it also contains some new results ...
As with all number types provided by this library, they support a full range of mathematical functions, operators, conversions, string formatting, etc. (see §4.3. Framework for numbers). using Jodosoft.Numerics; using System; Fix64 x = 100; Fix64 y = 2 * MathN.Cos(x); Fix64 z = ...
The covering number of a group G is the smallest integer k, such that Ck=G for all nonidentity conjugacy classes C of G. If no such integer exists, the covering number is defined to be ω, the smallest infinite ordinal. In this article the frequency of groups with covering number equal...
Journal of Machine Learning Research 2 (2002) 527-550 Submitted 6/2001; Published 3/2002 Covering Number Bounds of Certain Regularized Linear 来自 ResearchGate 喜欢 0 阅读量: 35 作者: Z Tong 摘要: Recently, sample complexity bounds have been derived for problems involving linear functions such ...