Auswahl der wissenschaftlichen Literatur zum Thema „Complexity“

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 den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Complexity" 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.

Zeitschriftenartikel zum Thema "Complexity"

1

Chow, Robert. "Complexity of Complexin." Biophysical Journal 106, no. 2 (2014): 11a. http://dx.doi.org/10.1016/j.bpj.2013.11.110.

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

BLOWS, M. W. "Complexity for complexity's sake?" Journal of Evolutionary Biology 20, no. 1 (2007): 39–44. http://dx.doi.org/10.1111/j.1420-9101.2006.01241.x.

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

Shoemaker, Jessica. "Complexity's Shadow: American Indian Property, Sovereignty, and the Future." Michigan Law Review, no. 115.4 (2017): 487. http://dx.doi.org/10.36644/mlr.115.4.complexity.

Der volle Inhalt der Quelle
Annotation:
This Article offers a new perspective on the challenges of the modern American Indian land tenure system. While some property theorists have renewed focus on isolated aspects of Indian land tenure, including the historic inequities of colonial takings of Indian lands, this Article argues that the complexity of today’s federally imposed reservation property system does much of the same colonizing work that historic Indian land policies—from allotment to removal to termination—did overtly. But now, these inequities are largely overshadowed by the daunting complexity of the whole land tenure stru
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Keune, Hans. "Critical complexity in environmental health practice: simplify and complexify." Environmental Health 11, Suppl 1 (2012): S19. http://dx.doi.org/10.1186/1476-069x-11-s1-s19.

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

Pöltner, P., and T. Grechenig. "Organic Finance Framework: Aligning Financing Complexity with Organisational Complexity (for Innovative Companies)." International Journal of Trade, Economics and Finance 11, no. 6 (2020): 156–62. http://dx.doi.org/10.18178/ijtef.2020.11.6.682.

Der volle Inhalt der Quelle
Annotation:
The organic finance framework is a new tool for managing the challenges of corporate financing. This framework is especially useful for small and medium-sized enterprises in the time of a crisis, such as the COVID-19 pandemic. At its core, the framework forces a rethink of the manner in which companies initiate their financing approach. In contrast to finding potential external sources of finance, the organic finance framework starts by looking at the relevant stakeholders of the company. Alternative financing methods, such as crowdfunding and crowdinvesting, have demonstrated that companies c
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Read, Dwight, and Claes Andersson. "Cultural complexity and complexity evolution." Adaptive Behavior 28, no. 5 (2019): 329–58. http://dx.doi.org/10.1177/1059712318822298.

Der volle Inhalt der Quelle
Annotation:
We review issues stemming from current models regarding the drivers of cultural complexity and cultural evolution. We disagree with the implication of the treadmill model, based on dual-inheritance theory, that population size is the driver of cultural complexity. The treadmill model reduces the evolution of artifact complexity, measured by the number of parts, to the statistical fact that individuals with high skills are more likely to be found in a larger population than in a smaller population. However, for the treadmill model to operate as claimed, implausibly high skill levels must be ass
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Goldreich, Oded, Rafail Ostrovsky, and Erez Petrank. "Computational Complexity and Knowledge Complexity." SIAM Journal on Computing 27, no. 4 (1998): 1116–41. http://dx.doi.org/10.1137/s0097539795280524.

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

LINIAL, NATI, and ADI SHRAIBMAN. "Learning Complexity vs Communication Complexity." Combinatorics, Probability and Computing 18, no. 1-2 (2009): 227–45. http://dx.doi.org/10.1017/s0963548308009656.

Der volle Inhalt der Quelle
Annotation:
This paper has two main focal points. We first consider an important class of machine learning algorithms: large margin classifiers, such as Support Vector Machines. The notion of margin complexity quantifies the extent to which a given class of functions can be learned by large margin classifiers. We prove that up to a small multiplicative constant, margin complexity is equal to the inverse of discrepancy. This establishes a strong tie between seemingly very different notions from two distinct areas.In the same way that matrix rigidity is related to rank, we introduce the notion of rigidity o
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Lachish, Oded, Ilan Newman, and Asaf Shapira. "Space Complexity Vs. Query Complexity." computational complexity 17, no. 1 (2008): 70–93. http://dx.doi.org/10.1007/s00037-008-0239-z.

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

Iván Tarride, Mario. "The complexity of measuring complexity." Kybernetes 42, no. 2 (2013): 174–84. http://dx.doi.org/10.1108/03684921311310558.

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

Dissertationen zum Thema "Complexity"

1

Baumler, Raphaël. "La sécurité de marché et son modèle maritime : entre dynamiques du risque et complexité des parades : les difficultés pour construire la sécurité." Thesis, Evry-Val d'Essonne, 2009. http://www.theses.fr/2009EVRY0024/document.

Der volle Inhalt der Quelle
Annotation:
Modèles de développement, capitalisme et industrialisme sont de grandes dynamiques du risque par leur capacité à transformer le social. Au niveau des firmes, l’innovation continue et la concurrence obligent à l’ajustement permanent. Soumises aux propriétaires, les firmes se focalisent sur le risque financier. Les autres risques lui sont subordonnés. Les dynamiques internes du risque évoluent au rythme d’impératifs externes. La compétition justifie réductions de coûts et réorganisations déstabilisantes. La sécurité a pour objectif la limitation des conditions de réalisation des risques. Constru
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Rubiano, Thomas. "Implicit Computational Complexity and Compilers." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD076/document.

Der volle Inhalt der Quelle
Annotation:
Complexity theory helps us predict and control resources, usually time and space, consumed by programs. Static analysis on specific syntactic criterion allows us to categorize some programs. A common approach is to observe the program’s data’s behavior. For instance, the detection of non-size-increasing programs is based on a simple principle : counting memory allocation and deallocation, particularly in loops. This way, we can detect programs which compute within a constant amount of space. This method can easily be expressed as property on control flow graphs. Because analyses on data’s beha
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Pankratov, Denis. "Communication complexity and information complexity." Thesis, The University of Chicago, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3711791.

Der volle Inhalt der Quelle
Annotation:
<p> Information complexity enables the use of information-theoretic tools in communication complexity theory. Prior to the results presented in this thesis, information complexity was mainly used for proving lower bounds and direct-sum theorems in the setting of communication complexity. We present three results that demonstrate new connections between information complexity and communication complexity.</p><p> In the first contribution we thoroughly study the information complexity of the smallest nontrivial two-party function: the AND function. While computing the communication complexity
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Smith, Peter. "Adaptive leadership: fighting complexity with complexity." Thesis, Monterey, California: Naval Postgraduate School, 2014. http://hdl.handle.net/10945/42728.

Der volle Inhalt der Quelle
Annotation:
CHDS State/Local<br>Contemporary crises have become increasingly complex and the methods of leading through them have failed to keep pace. If it is assumed that leadership matters—that it has a legitimate effect on the outcome of a crisis, then leaders have a duty to respond to that adaptation with modifications of their own. Using literature sources, the research explores crisis complexity, crisis leadership, and alternative leadership strategies. Specifically, the research evaluates the applicability of complexity science to current crises. Having identified the manner in which crises have c
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Chen, Lijie S. M. Massachusetts Institute of Technology. "Fine-grained complexity meets communication complexity." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122754.

Der volle Inhalt der Quelle
Annotation:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 215-229).<br>Fine-grained complexity aims to understand the exact exponent of the running time of fundamental problems in P. Basing on several important conjectures such as Strong Exponential Time Hypothesis (SETH), All-Pair Shortest Path Conjecture, and the 3-Sum Conjecture, tight conditional lower bounds are proved for numerous exact problems from all fields of computer science, showing that
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Gopalakrishnan, K. S. "Complexity cores in average-case complexity theory." [Ames, Iowa : Iowa State University], 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1473222.

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

Brochenin, Rémi. "Separation logic : expressiveness, complexity, temporal extension." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00956587.

Der volle Inhalt der Quelle
Annotation:
This thesis studies logics which express properties on programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here- rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known before this work. Also, its combination with some other verification methods was little studied. Firstly, in this work we isolate the operator of separation logic which makes it undecidable. We describe the expr
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Otto, James R. (James Ritchie). "Complexity doctrines." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=29104.

Der volle Inhalt der Quelle
Annotation:
We characterize various complexity classes as the images in set$ sp2,$ set$ sp{V},$ and set$ sp3$ of categories initial in various complexity doctrines. (A doctrine consists of the models of a theory of theories.) We so characterize the linear time, P space, linear space, P time, and Kalmar elementary functions as well as the linear time hierarchy relations. (Our machine model is multi-tape Turing machines with constant number of tapes.) These doctrines extend, using comprehensions, the first order doctrines GM and JB. We show, using dependent product diagrams, how to so extend the higher orde
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ada, Anil. "Communication complexity." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121119.

Der volle Inhalt der Quelle
Annotation:
Communication complexity studies how many bits a certain number of parties need to communicate with each other in order to compute a function whose input is distributed among those parties. Although it is a natural area of investigation based on practical considerations, the main motivation comes from the myriad of applications in theoretical computer science.This thesis has three main parts, studying three different aspects of communication complexity.1. The first part is concerned with the k-party communication complexity of functions F:({0,1}^n)^k -> {0,1} in the 'number on the forehead' (N
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Mariotti, Humberto, and Cristina Zauhy. "Managing Complexity." Universidad Peruana de Ciencias Aplicadas (UPC), 2014.

Den vollen Inhalt der Quelle finden
Annotation:
This article is a brief introduction to complexity, complex thinking and complexitymanagement. Its purpose is to present an update on the applications of the complexitysciences particularly to the universe of corporations and management. It includes anexample taken from the globalized world and two more stories from the corporateenvironment. Some details on how to think about complexity and how to apply theconceptual and operative tools of complex thinking are provided. The article ends withsome remarks on personal, interpersonal and corporate benefits of the complexthinking.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Complexity"

1

Watanabe, Osamu, ed. Kolmogorov Complexity and Computational Complexity. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77735-6.

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

1958-, Watanabe Osamu, ed. Kolmogorov complexity and computational complexity. Springer-Verlag, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Watanabe, Osamu. Kolmogorov Complexity and Computational Complexity. Springer Berlin Heidelberg, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Givón, T., and Masayoshi Shibatani, eds. Syntactic Complexity. John Benjamins Publishing Company, 2009. http://dx.doi.org/10.1075/tsl.85.

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

Miestamo, Matti, Kaius Sinnemäki, and Fred Karlsson, eds. Language Complexity. John Benjamins Publishing Company, 2008. http://dx.doi.org/10.1075/slcs.94.

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

Dehmer, Matthias, Frank Emmert-Streib, and Herbert Jodlbauer, eds. Entrepreneurial Complexity. CRC Press, 2019. http://dx.doi.org/10.1201/9781351250849.

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

Skobelev, Petr, and George Rzevski. Managing Complexity. SAE International, 2014. http://dx.doi.org/10.4271/1845649362.

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

Hickey, Anthony J., and Hugh D. C. Smyth. Pharmaco-Complexity. Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-7856-1.

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

Glattfelder, James B. Decoding Complexity. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-33424-5.

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

Downey, R. G., and M. R. Fellows. Parameterized Complexity. Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-0515-9.

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

Buchteile zum Thema "Complexity"

1

Jörg, Ton. "The Complexity of Complexity." In New Thinking in Complexity for the Social Sciences and Humanities. Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-94-007-1303-1_13.

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

Allender, Eric. "The Complexity of Complexity." In Computability and Complexity. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50062-1_6.

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

Lee, Li Way, and Aaron Keathley. "Complexity: The Complexity Fever." In 45 Conversations About Behavioral Economics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-05046-6_9.

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

Klir, George J. "Complexity." In Facets of Systems Science. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1331-5_8.

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

Cvitkovic, Emilio. "Complexity." In Competition. Palgrave Macmillan UK, 1993. http://dx.doi.org/10.1007/978-1-349-12857-0_8.

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

Boy, Guy André. "Complexity." In Human–Computer Interaction Series. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30270-6_5.

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

Forsdyke, Donald R. "Complexity." In Evolutionary Bioinformatics. Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-7771-7_14.

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

Peitgen, Heinz-Otto, Hartmut Jürgens, Dietmar Saupe, Evan Maletsky, Terry Perciante, and Lee Yunker. "Complexity." In Fractals for the Classroom: Strategic Activities Volume One. Springer New York, 1991. http://dx.doi.org/10.1007/978-1-4613-9047-3_3.

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

Hammer, Barbara. "Complexity." In Learning with recurrent neural networks. Springer London, 2000. http://dx.doi.org/10.1007/bfb0110021.

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

Steinhart, Eric. "Complexity." In Believing in Dawkins. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43052-8_2.

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

Konferenzberichte zum Thema "Complexity"

1

Taguchi, Chihiro, and David Chiang. "Language Complexity and Speech Recognition Accuracy: Orthographic Complexity Hurts, Phonological Complexity Doesn’t." In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-long.827.

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

Flack, Jessica. "Complexity begets complexity." In The 2021 Conference on Artificial Life. MIT Press, 2021. http://dx.doi.org/10.1162/isal_a_00470.

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

MORIN, EDGAR. "RESTRICTED COMPLEXITY, GENERAL COMPLEXITY." In Worldviews, Science and Us - Philosophy and Complexity. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812707420_0002.

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

"Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)." In Proceedings of Computational Complexity (Formerly Structure in Complexity Theory). IEEE, 1996. http://dx.doi.org/10.1109/ccc.1996.507662.

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

Linial, Nati, and Adi Shraibman. "Learning Complexity vs. Communication Complexity." In 2008 23rd Annual IEEE Conference on Computational Complexity. IEEE, 2008. http://dx.doi.org/10.1109/ccc.2008.28.

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

Agrawal, M., and V. Arvind. "A note on decision versus search for graph automorphism." In Proceedings of Computational Complexity (Formerly Structure in Complexity Theory). IEEE, 1996. http://dx.doi.org/10.1109/ccc.1996.507689.

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

"Author index." In Proceedings of Computational Complexity (Formerly Structure in Complexity Theory). IEEE, 1996. http://dx.doi.org/10.1109/ccc.1996.507693.

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

Cerra, Daniele, and Mihai Datcu. "Algorithmic Cross-Complexity and Relative Complexity." In 2009 Data Compression Conference (DCC). IEEE, 2009. http://dx.doi.org/10.1109/dcc.2009.6.

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

Kushilevitz, Eyal, and Enav Weinreb. "On the complexity of communication complexity." In the 41st annual ACM symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1536414.1536479.

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

Babai, Laszlo, Peter Frankl, and Janos Simon. "Complexity classes in communication complexity theory." In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). IEEE, 1986. http://dx.doi.org/10.1109/sfcs.1986.15.

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

Berichte der Organisationen zum Thema "Complexity"

1

Ackermann, Mark R., Nancy Kay Hayden, and Wendell Jones. Complexity and Simplicity: Putting Complexity Science in Perspective. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1481586.

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

White, D., M. Stowell, and K. Lange. Automatic Complexity Reduction. Office of Scientific and Technical Information (OSTI), 2014. http://dx.doi.org/10.2172/1179112.

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

Carvalho, Leandro, and Dan Silverman. Complexity and Sophistication. National Bureau of Economic Research, 2019. http://dx.doi.org/10.3386/w26036.

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

Salant, Yuval, and Jorg Spenkuch. Complexity and Choice. National Bureau of Economic Research, 2022. http://dx.doi.org/10.3386/w30002.

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

Enke, Benjamin, Thomas Graeber, and Ryan Oprea. Complexity and Time. National Bureau of Economic Research, 2023. http://dx.doi.org/10.3386/w31047.

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

Gomez-Gonzalez, Jose E., Jorge M. Uribe, and Oscar Valencia. Sovereign Risk and Economic Complexity. Inter-American Development Bank, 2024. http://dx.doi.org/10.18235/0005533.

Der volle Inhalt der Quelle
Annotation:
This paper investigates how a country's economic complexity influences its sovereign yield spread with respect to the United States. Notably, a one-unit increase in the Economic Complexity Index is associated with a reduction of about 87 basis points in the 10-year yield spread. However, this effect is largely non-significant for maturities under three years. This suggests that economic complexity affects not only the level of the sovereign yield spreads but also the curve slope. The first set of models utilizes advanced causal machine learning tools, while the second focuses on economic compl
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Blakesley, Paul J. Operational Shock Complexity Theory. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada437516.

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

Janusz, Paul E. The Complexity Analysis Tool. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada201700.

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

Valle Jr, Vicente. Chaos, Complexity and Deterrence. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada432927.

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

Streufert, Siegfried, Rosanne M. Pogash, and Mary T. Piasecki. Training for Cognitive Complexity. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada181828.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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!