Searching for "The Complexity of the Kn" – sorted by Relevance.
-
L'aszl'o Gy"orfi ##
- a density estimate^ fKn yielding almost sure convergence of the estimated complexity Kn to the true
- Add To MetaCart
-
Combinatorics of the bar resolution in group cohomology
- complex. Its columns are related to the cell complex Kn whose face poset is isomorphic to the subword
- Cited by 1 (0 self) – Add To MetaCart
-
Frequencies of factors in Arnoux-Rauzy sequences
- of (block) complexity kn+1 originally introduced by P. Arnoux and G. Rauzy. This vectorial division
- Cited by 12 (1 self) – Add To MetaCart
-
A SPECTRAL SEQUENCE DETERMINING THE HOMOLOGY OF Out(Fn) IN TERMS OF ITS MAPPING CLASS SUBGROUPS
- simplicial complex and the Out(Fn) action not being cocompact. The complex Kn can be constructed as a
- Add To MetaCart
-
Supported by the Austrian Federal Ministry of Education, Science and Culture
- the complexity of S (n) as Kn := sup x∈M Kx,n. A very common assumption in the theory of singular hyperbolic
- Add To MetaCart
-
A Universal Kernel for Learning Regular Languages
- the complexity of Kn to be a likely candidate for #P-complete, we have no proof of this; there is also the hope
- Cited by 1 (0 self) – Add To MetaCart
-
The symmetries of outer space
- complex and the action of Out(Fn) is by simplicial automorphisms. Let Aut(Kn) denote the group
- Cited by 3 (2 self) – Add To MetaCart
-
On Incremental Rendering of Silhouette Maps of a Polyhedral Scene
- vertices, the tight bounds of #(kn) and #(n#(k) + k 2 ) are known for, respectively, the complexity
- Add To MetaCart
-
(a) Forward Model
- in matrix gm(r) + KLN � �� � compute φk(r) = KMN + (K + M)LN Memory Complexity = KN � �� � store φk(r) K
- Add To MetaCart
-
Braiding and tangling the chessboard complex
- (Γ). Example 18 (The Chessboard Complex). If Kn,m is the complete bipartite graph on m red and n blue vertices
- Cited by 1 (0 self) – Add To MetaCart

