Zaloguj się

Gotowe bibliografie tematyczne / Combinatorics

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Combinatorics”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Combinatorics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Combinatorics"

1

Mazza, Giordano. "The Secrets of Calvino's Ars Combinatoria." Italica 99, no. 1 (2022): 40–57. http://dx.doi.org/10.5406/23256672.99.1.04.

Pełny tekst źródła

Streszczenie:

Abstract In this article, I explore the relationship between secrets and ars combinatoria, or the art of combining elements.1 In particular, I analyze this relationship in Italo Calvino's works, as Calvino can be thought of as the major representative of combinatorial literature in Italy. Although there are several published articles discussing the literary theory on secrecy, and several more analyzing combinatorial literature in Calvino, none discusses the importance of secrets in Calvino or links combinatorial literature with secrecy. I argue that ars combinatoria and, more specifically, com

Style APA, Harvard, Vancouver, ISO itp.

2

Gerards, A. M. H., and A. W. J. Kolen. "Polyhedral Combinatorics in Combinatorial Optimization." Statistica Neerlandica 41, no. 1 (1987): 1–25. http://dx.doi.org/10.1111/j.1467-9574.1987.tb01168.x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

MANDARIA, George. "The Methodology of Teaching Algorithms of Combinatorics: Permutations, Combinations, Arrangements." Journal of Technical Science and Technologies 7, no. 2 (2018): 1–6. http://dx.doi.org/10.31578/jtst.v7i2.139.

Pełny tekst źródła

Streszczenie:

In this article we have described the methodology for teaching the algorithms of combinatorics which are often used when solving tasks of informatics. These are the economic types of tasks in which we need to select different objects, sort selected objects in some order and choose the best selection from all possible selections. The formulas of calculating number of such selections are known from mathematics, but in informatics we are interested not only in number, but also in selections themselves, which can be generated by special algorithms. In general, the number of such selections is quit

Style APA, Harvard, Vancouver, ISO itp.

4

Dr., Mohd. Rizwanullah. "HISTORY OF COMBINATORIAL OPTIMIZATION: STUDY OF AN APPLICATION BASED NETWORK FLOWS." International Journal of Pure & Applied Mathematical Research 1, no. 1 (2017): 36–41. https://doi.org/10.5281/zenodo.10823935.

Pełny tekst źródła

Streszczenie:

Abstract -<strong><em> </em></strong><em>Combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. Combinatorial theory (or combinatorial analysis) is concerned with problems of enumeration and structure of mathematical objects. The objects may represent physical situation or things in applications or may be purely abstract and under study for theoretical reason. It is common practice to refer to the subject matter of combinatorial theory as combinatorics. The availability of reliable software, extremely fast and inexpensive hardware This pape

Style APA, Harvard, Vancouver, ISO itp.

5

Rocha, Cristiane Arimatéa, and Antonio Carlos De Souza. "Conhecimento de crianças pequenas da Educação Infantil e alunos dos anos iniciais do Ensino Fundamental sobre Combinatória: O que apontam as pesquisas brasileiras no período de 2010 a 2019?<br>Conocimiento de los niños pequeños en Educación Infantil y de los estudiantes de los primeros años de la escuela primaria sobre Combinatoria: ¿Qué señalan las investigaciones brasileñas en el período 2010-2019?" Educação Matemática Pesquisa Revista do Programa de Estudos Pós-Graduados em Educação Matemática 23, no. 4 (2021): 452–84. http://dx.doi.org/10.23925/983-3156.2021v23i4p452-484.

Pełny tekst źródła

Streszczenie:

A presente investigação discorre sobre um recorte de um projeto que visa apresentar as pesquisas em Educação Estatística no Brasil publicadas em periódicos da área de Ensino entre os anos de 2010 a 2019. Definimos como objetivo, para esse recorte, discutir pesquisas brasileiras que abordam conhecimentos de crianças pequenas da Educação Infantil e alunos dos anos iniciais do Ensino Fundamental sobre Combinatória no período mencionado. Foram identificados oito trabalhos que tratam direta ou indiretamente sobre conhecimentos de combinatória dos estudantes dessas etapas de escolarização. Direciona

Style APA, Harvard, Vancouver, ISO itp.

6

Pak, Igor, and Colleen Robichaux. "Signed combinatorial interpretations in algebraic combinatorics." Algebraic Combinatorics 8, no. 2 (2025): 495–519. https://doi.org/10.5802/alco.413.

Pełny tekst źródła

Streszczenie:

We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert theory. The results are stated in the language of computational complexity, while the proofs are based on the effective Möbius inversion.

Style APA, Harvard, Vancouver, ISO itp.

7

Bilkis, Cahaya, Martini, Muchamad Subali Noto, and Irmawati Liliyana Kusuma Dewi. "Uncovering the Secrets Behind Enumeration Rules: The Art of Combinatorics Thinking." International Journal of Educational Research Excellence (IJERE) 3, no. 2 (2024): 905–11. https://doi.org/10.55299/ijere.v3i2.1154.

Pełny tekst źródła

Streszczenie:

This research aims to analyze students' combinatorial thinking skills after using learning worksheets on enumeration rules. This research aims to provide solutions by applying learning materials to improve students' combinatorial thinking skills in solving math problems. The research method used is qualitative research. The research technique in this case is to use data triangulation. The purpose of triangulation is to increase the validity and reliability of research findings by confirming or complementing findings from various sources or perspectives. The results in this study are the divers

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

9

Patimo, Leonardo, and Jacinta Torres. "Atoms and charge in type C 2." Algebraic Combinatorics 8, no. 2 (2025): 521–74. https://doi.org/10.5802/alco.411.

Pełny tekst źródła

Streszczenie:

We construct atomic decompositions for crystals of type C 2 and use them to define a charge statistic, thus providing positive combinatorial formulas for the corresponding Kostka–Foulkes polynomials. Our methods include Kashiwara–Nakashima tableaux combinatorics as well as the combinatorics of string polytopes and twisted Bruhat graphs.

Style APA, Harvard, Vancouver, ISO itp.

10

HINKLE, BENJAMIN. "Parabolic limits of renormalization." Ergodic Theory and Dynamical Systems 20, no. 1 (2000): 173–229. http://dx.doi.org/10.1017/s0143385700000092.

Pełny tekst źródła

Streszczenie:

A unimodal map $f:[0,1] \to [0,1]$ is renormalizable if there is a sub-interval $I \subset [0,1]$ and an $n > 1$ such that $f^n|_I$ is unimodal. The renormalization of $f$ is $f^n|_I$ rescaled to the unit interval.We extend the well-known classification of limits of renormalization of unimodal maps with bounded combinatorics to a classification of the limits of renormalization of unimodal maps with essentially bounded combinatorics. Together with results of Lyubich on the limits of renormalization with essentially unbounded combinatorics, this completes the combinatorial description of limi

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Combinatorics"

1

Milicevic, Luka. "Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/273375.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Lopes, Martins Taísa. "Theory of combinatorial limits and extremal combinatorics." Thesis, University of Warwick, 2018. http://wrap.warwick.ac.uk/113462/.

Pełny tekst źródła

Streszczenie:

In the past years, techniques from different areas of mathematics have been successfully applied in extremal combinatorics problems. Examples include applications of number theory, geometry and group theory in Ramsey theory and analytical methods to different problems in extremal combinatorics. By providing an analytic point of view of many discrete problems, the theory of combinatorial limits led to substantial results in many areas of mathematics and computer science, in particular in extremal combinatorics. In this thesis, we explore the connection between combinatorial limits and extremal

Style APA, Harvard, Vancouver, ISO itp.

3

Yue, Guangyi. "Combinatorics of affine Springer fibers and combinatorial wall-crossing." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126939.

Pełny tekst źródła

Streszczenie:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020<br>Cataloged from the official PDF of thesis.<br>Includes bibliographical references (pages 149-152).<br>This thesis deals with several combinatorial problems in representation theory. The first part of the thesis studies the combinatorics of affine Springer fibers of type A. In particular, we give an explicit description of irreducible components of Fl[subscript tS] and calculate the relative positions between two components. We also study the lowest two-sided Kazhdan-Lusztig cell and establish a conne

Style APA, Harvard, Vancouver, ISO itp.

4

Lange, Carsten. "Combinatorial curvatures, group actions, and colourings: aspects of topological combinatorics." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=973473487.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Engström, Alexander. "Topological Combinatorics." Doctoral thesis, KTH, Matematik (Inst.), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-10383.

Pełny tekst źródła

Streszczenie:

This thesis on Topological Combinatorics contains 7 papers. All of them but paper Bare published before.In paper A we prove that!i dim ˜Hi(Ind(G);Q) ! |Ind(G[D])| for any graph G andits independence complex Ind(G), under the condition that G\D is a forest. We then use acorrespondence between the ground states with i+1 fermions of a supersymmetric latticemodel on G and ˜Hi(Ind(G);Q) to deal with some questions from theoretical physics.In paper B we generalize the topological Tverberg theorem. Call a graph on the samevertex set as a (d + 1)(q − 1)-simplex a (d, q)-Tverberg graph if for any map f

Style APA, Harvard, Vancouver, ISO itp.

6

Borenstein, Evan. "Additive stucture, rich lines, and exponential set-expansion." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29664.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009.<br>Committee Chair: Croot, Ernie; Committee Member: Costello, Kevin; Committee Member: Lyall, Neil; Committee Member: Tetali, Prasad; Committee Member: Yu, XingXing. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Style APA, Harvard, Vancouver, ISO itp.

7

PINTO, RONALD COUTINHO. "INTRODUCTION TO COMBINATORICS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24231@1.

Pełny tekst źródła

Streszczenie:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>Este trabalho possui o intuito de desmistificar a dificuldade encontrada por professores e alunos no ensino e aprendizagem do tópico análise combinatória. A razão que motivou este trabalho foi o fato de que boa parte dos professores de matemática do ensino médio e últimas séries do ensino fundamental consideram a Análise Combinatória como algo complicado de ser ensinado; além da questão das dificuldades de entendimento por parte dos alunos que são induzidos à memorização de fórmulas e a aplicação das mesmas à resolução dos exercícios para c

Style APA, Harvard, Vancouver, ISO itp.

8

Brunk, Fiona. "Intersection problems in combinatorics." Thesis, St Andrews, 2009. http://hdl.handle.net/10023/765.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Redelmeier, Daniel. "Hyperpfaffians in Algebraic Combinatorics." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1055.

Pełny tekst źródła

Streszczenie:

The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The hyperpfaffian, which was introduced by Barvinok, generalizes the pfaffian to higher dimension. This was further developed by Luque, Thibon and Abdesselam. There are several non-equivalent definitions for the hyperpfaffian, which are discussed in the introduction of this thesis. Following this we examine the extension of the Matrix-Tree theorem to the Hyperpfaffian-Cactus theorem by Abdesselam, proving it without the use of the Grassman-Berezin Calculus and with the new terminology o

Style APA, Harvard, Vancouver, ISO itp.

10

Sanders, Tom. "Topics in arithmetic combinatorics." Thesis, University of Cambridge, 2007. https://www.repository.cam.ac.uk/handle/1810/236994.

Pełny tekst źródła

Streszczenie:

This thesis is chiefly concerned with a classical conjecture of Littlewood's regarding the L¹-norm of the Fourier transform, and the closely related idem-potent theorem. The vast majority of the results regarding these problems are, in some sense, qualitative or at the very least infinitary and it has become increasingly apparent that a quantitative state of affairs is desirable. Broadly speaking, the first part of the thesis develops three new tools for tackling the problems above: We prove a new structural theorem for the spectrum of functions in A(G); we extend the notion of local Fourier a

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Combinatorics"

1

Mladenović, Pavle. Combinatorics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00831-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Merris, Russell. Combinatorics. PWS Pub. Co., 1996.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

A, Hajnal, Lovász László 1948-, Sós Vera T, and Hungarian Colloquium on Combinatorics (7th : 1987 : Eger, Hungary), eds. Combinatorics. North-Holland Pub. Co., 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Faticoni, Theodore G. Combinatorics: An introduction. Wiley, 2013.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Adhikari, S. D. Aspects of combinatorics and combinatorial number theory. Alpha Science, 2002.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Bajnok, Béla. Additive Combinatorics. Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781351137621.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Kashiwara, Masaki, and Tetsuji Miwa, eds. Physical Combinatorics. Birkhäuser Boston, 2000. http://dx.doi.org/10.1007/978-1-4612-1378-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Stanley, Richard P. Algebraic Combinatorics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77173-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Stanley, Richard P. Enumerative Combinatorics. Springer US, 1986. http://dx.doi.org/10.1007/978-1-4615-9763-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Stanley, Richard P. Algebraic Combinatorics. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6998-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Combinatorics"

1

Ivanov, O. A. "Combinatorics". У Easy as π? Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-0553-1_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Simovici, Dan A., and Chabane Djeraba. "Combinatorics." In Advanced Information and Knowledge Processing. Springer London, 2014. http://dx.doi.org/10.1007/978-1-4471-6407-4_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Sedrakyan, Hayk, and Nairi Sedrakyan. "Combinatorics." In The Stair-Step Approach in Mathematics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70632-0_5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Ubøe, Jan. "Combinatorics." In Springer Texts in Business and Economics. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70936-9_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Nelson, Randolph. "Combinatorics." In Probability, Stochastic Processes, and Queueing Theory. Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4757-2426-4_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Hurlbert, Glenn H. "Combinatorics." In Undergraduate Texts in Mathematics. Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-79148-7_11.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Harris, John M., Jeffry L. Hirst, and Michael J. Mossinghoff. "Combinatorics." In Combinatorics and Graph Theory. Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-79711-3_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Thomson, Norman D. "Combinatorics." In APL Programs for the Mathematics Classroom. Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4612-3668-9_9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Lawler, Eugene L. "Combinatorics." In Encyclopedia of Operations Research and Management Science. Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_132.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Lozansky, Edward, and Cecil Rousseau. "Combinatorics." In Winning Solutions. Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-4034-1_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Combinatorics"

1

Barr, Joseph R., Jon C. Haass, Peter Shaw, and Faisal N. Abu-Khzam. "Combinatorics in AI: Principles & Algorithms An Extended Abstract." In 2024 Conference on AI, Science, Engineering, and Technology (AIxSET). IEEE, 2024. https://doi.org/10.1109/aixset62544.2024.00057.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Doan, Long, and ThanhVu Nguyen. "AI-Assisted Autoformalization of Combinatorics Problems in Proof Assistants." In 2025 IEEE/ACM 47th International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER). IEEE, 2025. https://doi.org/10.1109/icse-nier66352.2025.00006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

DI FRANCESCO, PHILIPPE. "INTEGRABLE COMBINATORICS." In International Congress of Mathematicians 2018. WORLD SCIENTIFIC, 2019. http://dx.doi.org/10.1142/9789813272880_0151.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Ito, Masami. "Words, Languages and Combinatorics." In International Colloquium on Words, Languages and Combinatorics. WORLD SCIENTIFIC, 1992. http://dx.doi.org/10.1142/9789814538978.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Gonthier, Georges. "Combinatorics for theorem proving." In the 1st Workshop. ACM Press, 2009. http://dx.doi.org/10.1145/1735813.1735814.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Alahmad, Mahmoud, and Wisam Nader. "Combinatorics & power consumption." In 2011 IEEE Long Island Systems, Applications and Technology Conference (LISAT). IEEE, 2011. http://dx.doi.org/10.1109/lisat.2011.5784221.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Chen, Shaoshi, and Stephen M. Watt. "Combinatorics of Hybrid Sets." In 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2016. http://dx.doi.org/10.1109/synasc.2016.022.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Yap, H. P., T. H. Ku, E. K. Lloyd, and Z. M. Wang. "Combinatorics and Graph Theory." In Proceedings of the Spring School and International Conference on Combinatorics. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814535342.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Bendkowski, Maciej, and Pierre Lescanne. "Combinatorics of Explicit Substitutions." In PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming. ACM, 2018. http://dx.doi.org/10.1145/3236950.3236951.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

KIRILLOV, ANATOL N. "INTRODUCTION TO TROPICAL COMBINATORICS." In Proceedings of the Nagoya 2000 International Workshop. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812810007_0005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Combinatorics"

1

Chen, W. Y. C., and J. D. Louck. Combinatorics, geometry, and mathematical physics. Office of Scientific and Technical Information (OSTI), 1998. http://dx.doi.org/10.2172/674871.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Hanlon, Philip J., Dean Chung, Siddhartha Chatterjee, Daniel Genius, Alivn R. Lebeck, and Erin Parker. The Combinatorics of Cache Misses During Matrix Multiplication. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada448806.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Srivastava, J. N. Bose Memorial Conference on Statistical Design and Related Combinatorics. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada299907.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Srivastava, J. N. Bose Memorial Conference on Statistical Design and Related Combinatorics. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada300029.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Vu, Van H. Random Matrices, Combinatorics, Numerical Linear Algebra and Complex Networks. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada567088.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Srivastava, J. Multivariate Problems of Statistics, Combinatorics, Reliability, and Signal Processing. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada265213.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Grimson, W. E. The Combinatorics of Object Recognition in Cluttered Environments Using Constrained Search. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada196224.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Grimson, W. E. The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada209690.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Chau, Herman, Helen Jenne, Davis Brown, Sara Billey, Mark Raugas, and Henry Kvinge. Machine Learning meets Algebraic Combinatorics: A Suite of Benchmark Datasets to Accelerate AI for Mathematics Research. Office of Scientific and Technical Information (OSTI), 2024. http://dx.doi.org/10.2172/2476539.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Kuhn, Richard, Raghu N. Kacker, and Yu Lei. Combinatorial Coverage Measurement. National Institute of Standards and Technology, 2012. http://dx.doi.org/10.6028/nist.ir.7878.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!