Thematische Bibliographien / Combinatorics of cores / Zeitschriftenartikel

Zeitschriftenartikel zum Thema „Combinatorics of cores“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Combinatorics of cores.
Autor: Grafiati
Veröffentlicht am 5. Oktober 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Combinatorics of cores" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Aukerman, David, Ben Kane und Lawrence Sze. „On simultaneous s-cores/t-cores“. Discrete Mathematics 309, Nr. 9 (Mai 2009): 2712–20. http://dx.doi.org/10.1016/j.disc.2008.06.024.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Godsil, Chris, und Gordon F. Royle. „Cores of Geometric Graphs“. Annals of Combinatorics 15, Nr. 2 (15.05.2011): 267–76. http://dx.doi.org/10.1007/s00026-011-0094-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Mančinska, Laura, Irene Pivotto, David E. Roberson und Gordon F. Royle. „Cores of cubelike graphs“. European Journal of Combinatorics 87 (Juni 2020): 103092. http://dx.doi.org/10.1016/j.ejc.2020.103092.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Han, Guo-Niu, und Ken Ono. „Hook Lengths and 3-Cores“. Annals of Combinatorics 15, Nr. 2 (15.05.2011): 305–12. http://dx.doi.org/10.1007/s00026-011-0096-3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Sato, Cristiane M. „On the robustness of randomk-cores“. European Journal of Combinatorics 41 (Oktober 2014): 163–82. http://dx.doi.org/10.1016/j.ejc.2014.03.007.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Malen, Greg. „Homomorphism complexes andk-cores“. Discrete Mathematics 341, Nr. 9 (September 2018): 2567–74. http://dx.doi.org/10.1016/j.disc.2018.06.014.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Cho, Hyunsoo, und Kyounghwan Hong. „Corners of self-conjugate (s,s + 1)-cores and (s‾,s+1‾)-cores“. Discrete Mathematics 345, Nr. 9 (September 2022): 112949. http://dx.doi.org/10.1016/j.disc.2022.112949.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Baruah, Nayandeep Deka, und Kallol Nath. „Infinite families of arithmetic identities for self-conjugate 5-cores and 7-cores“. Discrete Mathematics 321 (April 2014): 57–67. http://dx.doi.org/10.1016/j.disc.2013.12.019.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Thiel, Marko, und Nathan Williams. „Strange expectations and simultaneous cores“. Journal of Algebraic Combinatorics 46, Nr. 1 (10.04.2017): 219–61. http://dx.doi.org/10.1007/s10801-017-0754-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Kotsireas, Ilias S., Christos Koukouvinos und Jennifer Seberry. „Hadamard ideals and Hadamard matrices with two circulant cores“. European Journal of Combinatorics 27, Nr. 5 (Juli 2006): 658–68. http://dx.doi.org/10.1016/j.ejc.2005.03.004.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Haglund, Jim, Ken Ono und Lawrence Sze. „Rook Theory andt-Cores“. Journal of Combinatorial Theory, Series A 84, Nr. 1 (Oktober 1998): 9–37. http://dx.doi.org/10.1006/jcta.1998.2874.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

Marietti, Mario, und Damiano Testa. „Cores of Simplicial Complexes“. Discrete & Computational Geometry 40, Nr. 3 (15.05.2008): 444–68. http://dx.doi.org/10.1007/s00454-008-9081-y.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

Paramonov, Kirill. „Cores with distinct parts and bigraded Fibonacci numbers“. Discrete Mathematics 341, Nr. 4 (April 2018): 875–88. http://dx.doi.org/10.1016/j.disc.2017.12.010.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

Boros, E., und V. Gurvich. „Perfect graphs, kernels, and cores of cooperative games“. Discrete Mathematics 306, Nr. 19-20 (Oktober 2006): 2336–54. http://dx.doi.org/10.1016/j.disc.2005.12.031.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

Solymosi, David, und Jozsef Solymosi. „Small cores in 3-uniform hypergraphs“. Journal of Combinatorial Theory, Series B 122 (Januar 2017): 897–910. http://dx.doi.org/10.1016/j.jctb.2016.11.001.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Bowditch, Brian. „An upper bound for injectivity radii in convex cores“. Groups, Geometry, and Dynamics 7, Nr. 1 (2013): 109–26. http://dx.doi.org/10.4171/ggd/178.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Berkovich, Alexander, und Hamza Yesilyurt. „New identities for 7-cores with prescribed BG-rank“. Discrete Mathematics 308, Nr. 22 (November 2008): 5246–59. http://dx.doi.org/10.1016/j.disc.2007.09.044.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
18

Butkovič, Peter, Hans Schneider, Sergeĭ Sergeev und Bit-Shun Tam. „Two cores of a nonnegative matrix“. Linear Algebra and its Applications 439, Nr. 7 (Oktober 2013): 1929–54. http://dx.doi.org/10.1016/j.laa.2013.05.029.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
19

Ono, Ken, und Wissam Raji. „Class numbers and self-conjugate 7-cores“. Journal of Combinatorial Theory, Series A 180 (Mai 2021): 105427. http://dx.doi.org/10.1016/j.jcta.2021.105427.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
20

Olsson, Jørn B. „A theorem on the cores of partitions“. Journal of Combinatorial Theory, Series A 116, Nr. 3 (April 2009): 733–40. http://dx.doi.org/10.1016/j.jcta.2008.08.004.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
21

Bauslaugh, Bruce L. „Cores and Compactness of Infinite Directed Graphs“. Journal of Combinatorial Theory, Series B 68, Nr. 2 (November 1996): 255–76. http://dx.doi.org/10.1006/jctb.1996.0068.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
22

Liu, Juan, Hong Yang, Xindong Zhang und Hong-Jian Lai. „Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs“. Discrete Mathematics 347, Nr. 4 (April 2024): 113867. http://dx.doi.org/10.1016/j.disc.2023.113867.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
23

Anderson, Jaclyn. „On the existence of rook equivalent t-cores“. Journal of Combinatorial Theory, Series A 106, Nr. 2 (Mai 2004): 221–36. http://dx.doi.org/10.1016/j.jcta.2004.01.010.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
24

Lulov, Nathan, und Boris Pittel. „On the Random Young Diagrams and Their Cores“. Journal of Combinatorial Theory, Series A 86, Nr. 2 (Mai 1999): 245–80. http://dx.doi.org/10.1006/jcta.1998.2939.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
25

Osoba, Benard, und Temitope Gbolahan Jaiyeola. „Algebraic connections between right and middle Bol loops and their cores“. Quasigroups and Related Systems 30, Nr. 1(47) (Mai 2022): 149–60. http://dx.doi.org/10.56415/qrs.v30.13.

Der volle Inhalt der Quelle
Annotation:
To every right or left Bol loop corresponds a middle Bol loop. In this paper, the cores of right Bol loops (RBL) and its corresponding middle Bol loops (MBL) were studied. Their algebraic connections were considered. It was shown that the core of a RBL is elastic and right idempotent. The core of a RBL was found to be alternative (or left idempotent) if and only if its corresponding MBL is right symmetric. If a MBL is right (left) symmetric, then, the core of its corresponding RBL is a medial (semimedial). The core of a middle Bol loop has the left inverse property (automorphic inverse property, right idempotence resp.) if and only if its corresponding RBL has the super anti-automorphic inverse property (automorphic inverse property, exponent 2 resp.). If a RBL is of exponent 2, then, the core of its corresponding MBL is left idempotent. If a RBL is of exponent 2 then: the core of a MBL has the left alternative property (right alternative property) if and only if its corresponding RBL has the cross inverse property (middle symmetry). Some other similar results were derived for RBL of exponent 3.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
26

Tarau, Paul. „Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms“. Fundamenta Informaticae 177, Nr. 3-4 (10.12.2020): 385–415. http://dx.doi.org/10.3233/fi-2020-1994.

Der volle Inhalt der Quelle
Annotation:
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of simply-typed closed lambda terms of a given size. Moreover, their asymptotic scarcity among the set of closed lambda terms makes counting them via brute force generation and type inference quickly intractable, with previous published work showing counts for them only up to size 10. By taking advantage of the synergy between logic variables, unification with occurs check and efficient backtracking in today’s Prolog systems, we climb 4 orders of magnitude above previously known counts by deriving progressively faster sequential Prolog programs that generate and/or count the set of closed simply-typed lambda terms of sizes up to 14. Similar counts for closed simply-typed normal forms are also derived up to size 14. Finally, we devise several parallel execution algorithms, based on generating code to be uniformly distributed among the available cores, that push the counts for simply typed terms up to size 15 and simply typed normal forms up to size 16. As a remarkable feature, our parallel algorithms are linearly scalable with the number of available cores.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
27

Bonato, Anthony, und Paweł Prałat. „The good, the bad, and the great: Homomorphisms and cores of random graphs“. Discrete Mathematics 309, Nr. 18 (September 2009): 5535–39. http://dx.doi.org/10.1016/j.disc.2008.03.026.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
28

Cho, Hyunsoo, JiSun Huh, Hayan Nam und Jaebum Sohn. „Results on bar-core partitions, core shifted Young diagrams, and doubled distinct cores“. Discrete Mathematics 346, Nr. 7 (Juli 2023): 113387. http://dx.doi.org/10.1016/j.disc.2023.113387.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
29

DeBiasio, Louis, András Gyárfás und Gábor N. Sárközy. „Ramsey numbers of path-matchings, covering designs, and 1-cores“. Journal of Combinatorial Theory, Series B 146 (Januar 2021): 124–40. http://dx.doi.org/10.1016/j.jctb.2020.09.004.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
30

González-Torres, Raúl E. „A geometric study of cores of idempotent stochastic matrices“. Linear Algebra and its Applications 527 (August 2017): 87–127. http://dx.doi.org/10.1016/j.laa.2017.03.032.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
31

Mardiningsih, Saib Suwilo und Ihda Hasbiyati. „Existence of Polynomial Combinatorics Graph Solution“. Journal of Research in Mathematics Trends and Technology 2, Nr. 1 (24.02.2020): 7–13. http://dx.doi.org/10.32734/jormtt.v2i1.3755.

Der volle Inhalt der Quelle
Annotation:
The Polynomial Combinatorics comes from optimization problem combinatorial in form the nonlinear and integer programming. This paper present a condition such that the polynomial combinatorics has solution. Existence of optimum value will be found by restriction of decision variable and properties of feasible solution set or polyhedra.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
32

Damaschke, Peter. „Multiple hypernode hitting sets and smallest two-cores with targets“. Journal of Combinatorial Optimization 18, Nr. 3 (29.05.2009): 294–306. http://dx.doi.org/10.1007/s10878-009-9234-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
33

Lapointe, Luc, und Jennifer Morse. „Tableaux on k+1-cores, reduced words for affine permutations, and k-Schur expansions“. Journal of Combinatorial Theory, Series A 112, Nr. 1 (Oktober 2005): 44–81. http://dx.doi.org/10.1016/j.jcta.2005.01.003.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
34

Giusti, Chad, und Vladimir Itskov. „A No-Go Theorem for One-Layer Feedforward Networks“. Neural Computation 26, Nr. 11 (November 2014): 2527–40. http://dx.doi.org/10.1162/neco_a_00657.

Der volle Inhalt der Quelle
Annotation:
It is often hypothesized that a crucial role for recurrent connections in the brain is to constrain the set of possible response patterns, thereby shaping the neural code. This implies the existence of neural codes that cannot arise solely from feedforward processing. We set out to find such codes in the context of one-layer feedforward networks and identified a large class of combinatorial codes that indeed cannot be shaped by the feedforward architecture alone. However, these codes are difficult to distinguish from codes that share the same sets of maximal activity patterns in the presence of subtractive noise. When we coarsened the notion of combinatorial neural code to keep track of only maximal patterns, we found the surprising result that all such codes can in fact be realized by one-layer feedforward networks. This suggests that recurrent or many-layer feedforward architectures are not necessary for shaping the (coarse) combinatorial features of neural codes. In particular, it is not possible to infer a computational role for recurrent connections from the combinatorics of neural response patterns alone. Our proofs use mathematical tools from classical combinatorial topology, such as the nerve lemma and the existence of an inverse nerve. An unexpected corollary of our main result is that any prescribed (finite) homotopy type can be realized by a subset of the form [Formula: see text], where [Formula: see text] is a polyhedron.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
35

Da Rocha, V. C. „Combinatorial codes“. Electronics Letters 21, Nr. 21 (1985): 949. http://dx.doi.org/10.1049/el:19850670.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
36

Wallace, Mark, und Neil Yorke-Smith. „A new constraint programming model and solving for the cyclic hoist scheduling problem“. Constraints 25, Nr. 3-4 (09.11.2020): 319–37. http://dx.doi.org/10.1007/s10601-020-09316-z.

Der volle Inhalt der Quelle
Annotation:
AbstractThe cyclic hoist scheduling problem (CHSP) is a well-studied optimisation problem due to its importance in industry. Despite the wide range of solving techniques applied to the CHSP and its variants, the models have remained complicated and inflexible, or have failed to scale up with larger problem instances. This article re-examines modelling of the CHSP and proposes a new simple, flexible constraint programming formulation. We compare current state-of-the-art solving technologies on this formulation, and show that modelling in a high-level constraint language, MiniZinc, leads to both a simple, generic model and to computational results that outperform the state of the art. We further demonstrate that combining integer programming and lazy clause generation, using the multiple cores of modern processors, has potential to improve over either solving approach alone.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
37

HIRD, J. T., NAIHUAN JING und ERNEST STITZINGER. „CODES AND SHIFTED CODES“. International Journal of Algebra and Computation 22, Nr. 06 (31.08.2012): 1250054. http://dx.doi.org/10.1142/s0218196712500543.

Der volle Inhalt der Quelle
Annotation:
The action of the Bernstein operators on Schur functions was given in terms of codes by Carrell and Goulden (2011) and extended to the analog in Schur Q-functions in our previous work. We define a new combinatorial model of extended codes and show that both of these results follow from a natural combinatorial relation induced on codes. The new algebraic structure provides a natural setting for Schur functions indexed by compositions.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
38

B. Paterson, M., D. R. Stinson und R. Wei. „Combinatorial batch codes“. Advances in Mathematics of Communications 3, Nr. 1 (2009): 13–27. http://dx.doi.org/10.3934/amc.2009.3.13.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
39

Davidson, Ruth, und Seth Sullivant. „Polyhedral combinatorics of UPGMA cones“. Advances in Applied Mathematics 50, Nr. 2 (Februar 2013): 327–38. http://dx.doi.org/10.1016/j.aam.2012.10.002.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
40

Krieger, M. H. „Where Do Centers Come From?“ Environment and Planning A: Economy and Space 19, Nr. 9 (September 1987): 1251–60. http://dx.doi.org/10.1068/a191251.

Der volle Inhalt der Quelle
Annotation:
A ‘center’ is a marked place in space or time or in a collection of objects, and surrounding it is a structure or pattern that supports it. The questions that concern us here are: ‘Why are there centers at all?’ ‘Why is a center at a particular X?’ Historical and combinatorial processes of centralization are reviewed, and a phenomenology and mechanisms are provided. Models considered include: stochastic markets with increasing returns to scale, codes as in DNA, combinatoric processes as in statistical mechanics, and differentiation in biology. Polycenters.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
41

HIRD, J. T., NAIHUAN JING und ERNEST STITZINGER. „CODES AND SHIFTED CODES OF PARTITIONS“. International Journal of Algebra and Computation 21, Nr. 08 (Dezember 2011): 1447–62. http://dx.doi.org/10.1142/s0218196711006595.

Der volle Inhalt der Quelle
Annotation:
In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's theorem. We show that this identity is a straightforward consequence of the classical result. We also show how a similar approach using the codes of partitions can be generalized from Schur functions to also include Schur Q-functions and derive the combinatorial formulation for both cases. We then apply them by examining the Littlewood–Richardson and Pieri rules.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
42

García-Calcines, José Manuel, Luis Javier Hernández-Paricio und María Teresa Rivas-Rodríguez. „Augmented Simplicial Combinatorics through Category Theory: Cones, Suspensions and Joins“. Mathematics 10, Nr. 4 (14.02.2022): 590. http://dx.doi.org/10.3390/math10040590.

Der volle Inhalt der Quelle
Annotation:
In this work, we analyze the combinatorial properties of the category of augmented semi-simplicial sets. We consider various monoidal structures induced by the co-product, the product, and the join operator in this category. In addition, we also consider monoidal structures on augmented sequences of integers induced by the sum and product of integers and by the join of augmented sequences. The cardinal functor that associates to each finite set X its cardinal |X| induces the sequential cardinal that associates to each augmented semi-simplicial finite set X an augmented sequence |X|n of non-negative integers. We prove that the sequential cardinal functor is monoidal for the corresponding monoidal structures. This allows us to easily calculate the number of simplices of cones and suspensions of an augmented semi-simplicial set as well as other augmented semi-simplicial sets which are built by joins. In this way, the monoidal structures of the augmented sequences of numbers may be thought of as an algebraization of the augmented semi-simplicial sets that allows us to do a simpler study of the combinatorics of the augmented semi-simplicial finite sets.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
43

Aggarwal, Divesh, Yevgeniy Dodis und Shachar Lovett. „Non-Malleable Codes from Additive Combinatorics“. SIAM Journal on Computing 47, Nr. 2 (Januar 2018): 524–46. http://dx.doi.org/10.1137/140985251.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
44

Ghazi, Arjumand, und K. VijayRaghavan. „Control by combinatorial codes“. Nature 408, Nr. 6811 (November 2000): 419–20. http://dx.doi.org/10.1038/35044174.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
45

Zhang, Hui, Eitan Yaakobi und Natalia Silberstein. „Multiset combinatorial batch codes“. Designs, Codes and Cryptography 86, Nr. 11 (23.02.2018): 2645–60. http://dx.doi.org/10.1007/s10623-018-0468-3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
46

HSIEH, CHUN-CHUNG. „COMBINATORIC MASSEY–MILNOR LINKING THEORY“. Journal of Knot Theory and Its Ramifications 20, Nr. 06 (Juni 2011): 927–38. http://dx.doi.org/10.1142/s0218216511009030.

Der volle Inhalt der Quelle
Annotation:
In this paper following the scheme of Massey–Milnor invariant theory [C. C. Hsieh, Combinatoric and diagrammatic studies in knot theory J. Knot Theory Ramifications16 (2007) 1235–1253; C. C. Hsieh, Massey-Milnor linking = Chern-Simons-Witten graphs, J. Knot Theory Ramifications17 (2008) 877–903; C. C. Hsieh and S. W. Yang, Chern-Simons-Witten configuration space integrals in knot theory, J. Knot Theory Ramifications14 (2005) 689–711], we studied the first non-vanishing linkings of knot theory in ℝ3 and also derived the combinatorial formulae from which we could read out the invariants directly from the knot diagrams. Though the theme is calculus, the idea comes from perturbative quantum field theory.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
47

Sneyd, Alison. „Codes over rings and applications to combinatorics“. Irish Mathematical Society Bulletin 0072 (2013): 37. http://dx.doi.org/10.33232/bims.0072.37.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
48

Ghorpade, Sudhir R., und Michael A. Tsfasman. „Schubert varieties, linear codes and enumerative combinatorics“. Finite Fields and Their Applications 11, Nr. 4 (November 2005): 684–99. http://dx.doi.org/10.1016/j.ffa.2004.09.002.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
49

Stinson, D. R. „The combinatorics of authentication and secrecy codes“. Journal of Cryptology 2, Nr. 1 (Februar 1990): 23–49. http://dx.doi.org/10.1007/bf02252868.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
50

Alami, Mustapha, Mohamed Bekkali, Latifa Faouzi und Driss Zhani. „Free poset algebras and combinatorics of cones“. Annals of Mathematics and Artificial Intelligence 49, Nr. 1-4 (13.06.2007): 15–26. http://dx.doi.org/10.1007/s10472-007-9058-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Combinatorics of cores" für andere Quellenarten können Sie auch interessieren:
Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie