Relevant bibliographies by topics / Complexity theory

Academic literature on the topic 'Complexity theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Complexity theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Complexity theory"

1

Bürgisser, Peter, Oded Goldreich, Madhu Sudan, and Salil Vadhan. "Complexity Theory." Oberwolfach Reports 9, no. 4 (2012): 3267–304. http://dx.doi.org/10.4171/owr/2012/54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bürgisser, Peter, Oded Goldreich, Madhu Sudan, and Salil Vadhan. "Complexity Theory." Oberwolfach Reports 12, no. 4 (2015): 3049–99. http://dx.doi.org/10.4171/owr/2015/54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bürgisser, Peter, Irit Dinur, Oded Goldreich, and Salil Vadhan. "Complexity Theory." Oberwolfach Reports 15, no. 4 (December 16, 2019): 3025–80. http://dx.doi.org/10.4171/owr/2018/51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hemaspaandra, Lane A. "Complexity theory." ACM SIGACT News 32, no. 3 (September 2001): 40–52. http://dx.doi.org/10.1145/500559.500560.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bürgisser, Peter, Irit Dinur, and Salil Vadhan. "Complexity Theory." Oberwolfach Reports 18, no. 4 (November 25, 2022): 2955–3005. http://dx.doi.org/10.4171/owr/2021/54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Čenek, E. W. "Computability and complexity theory and the complexity theory companion." ACM SIGACT News 33, no. 3 (September 2002): 17–19. http://dx.doi.org/10.1145/582475.582480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sow, D. M., and A. Eleftheriadis. "Complexity distortion theory." IEEE Transactions on Information Theory 49, no. 3 (March 2003): 604–8. http://dx.doi.org/10.1109/tit.2002.808135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bläser, Markus, and Bodo Manthey. "Smoothed Complexity Theory." ACM Transactions on Computation Theory 7, no. 2 (May 11, 2015): 1–21. http://dx.doi.org/10.1145/2656210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gathen, J. V. Z. "Algebraic Complexity Theory." Annual Review of Computer Science 3, no. 1 (June 1988): 317–48. http://dx.doi.org/10.1146/annurev.cs.03.060188.001533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Loui, Michael C. "Computational complexity theory." ACM Computing Surveys 28, no. 1 (March 1996): 47–49. http://dx.doi.org/10.1145/234313.234337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Complexity theory"

1

Gomaa, Walid. "Model theory and complexity theory." College Park, Md. : University of Maryland, 2007. http://hdl.handle.net/1903/7227.

Full text
Abstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2007.
Thesis research directed by: Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Batista, Sandra Leonidas. "Martingales and complexity theory." Diss., Restricted to subscribing institutions, 2009. http://proquest.umi.com/pqdweb?did=1971757781&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hansen, Claire Gwendoline. "Shakespeare and Complexity Theory." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/13667.

Full text
Abstract:
Abstract: This thesis argues that Shakespeare is a complex system and that the framework of complexity theory can be of use to Shakespeare studies and literary studies more broadly. Moving from smaller subsystems to the global Shakespeare system itself, this thesis explores how Shakespeare’s narrative, play composition, pedagogy and cultural presence can be re-examined through a complexivist lens. By adopting different methodological approaches across the chapters, this thesis also refines the application of complexity theory and trials implementation strategies for the humanities. The Introduction offers a foundation for complexity theory in literary studies, including core characteristics and methods of implementation. Chapter One reads dance in A Midsummer Night’s Dream as a series of complex interactions which create or respond to moments of crisis or ‘bounded instability’. Chapter Two conceptualises Titus Andronicus as a self-organised complex system and interrogates three self-organising interactions: the relationships between co-authors; authors and space; and fictional and environmental space. Chapter Three’s pedagogical focus reconsiders the role of unexpected emergence in the teaching of Shakespeare and in The Merchant of Venice. Chapter Four examines the function of system attractors in the real-world system of Shakespeare in Stratford-upon-Avon and in the systems of Julius Caesar. Each chapter demonstrates complexivism as an illuminating framework for Shakespeare studies, identifying complex behavioural patterns in the plays, their contexts, and in literary criticism. This thesis also demonstrates complexity theory’s interdisciplinary applicability in fields of inquiry including the philosophy of dance, authorship studies, ecocriticism and cultural studies. ‘Shakespeare and Complexity Theory’ offers a novel and valuable framework to enrich our understanding of Shakespeare, and lays the foundation for complexity theory in Shakespeare studies and the humanities.
APA, Harvard, Vancouver, ISO, and other styles
5

Böhler, Elmar. "Algebraic closures in complexity theory." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=978707176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Webb, Paul, and Pam Austin. "Family Maths and Complexity Theory." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-81109.

Full text
Abstract:
The importance of family involvement is highlighted by findings that parents’ behaviours, beliefs and attitudes affect children’s behaviour in a major way. The Family Maths programme, which is the focus of this study, provides support for the transformative education practices targeted by the South African Department of Education by offering an intervention which includes teachers, learners and their families in an affirming learning community. In this study participating parents were interviewed to investigate their perceptions of the Family Maths programme mainly in terms of their engagement, enjoyment and confidence levels. The major themes and ideas that were generated in this study include the development of positive attitudes, parents and children working and talking together, and the skills exhibited by Family Maths facilitators. These findings are analysed within the parameters of complexity science and the pre-requisite conditions for developing a complex learning community, viz. internal diversity, redundancy, decentralized control, organised randomness and neighbour interactions.
APA, Harvard, Vancouver, ISO, and other styles
7

Yamakami, Tomoyuki. "Average case computational complexity theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq28091.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Tae-Sik 1974. "Complexity theory in axiomatic design." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29631.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2003.
Includes bibliographical references (p. 177-182).
During the last couple of decades, the term complexity has been commonly found in use in many fields of science, sometimes as a measurable quantity with a rigorous but narrow definition and other times as merely an ad hoc label. With an emphasis on pragmatic engineering applications, this thesis investigates the complexity concept defined in axiomatic design theory to avoid vague use of the term 'complexity' in engineering system design, to provide deeper insight into possible causes of complexity, and to develop a systematic approach to complexity reduction. The complexity concept in axiomatic design theory is defined as a measure of uncertainty in achieving a desired set of functional requirements. In this thesis, it is revisited to refine its definition. Four different types of complexity are identified in axiomatic design complexity theory: time-independent real complexity, time-independent imaginary complexity, time-dependent combinatorial complexity and time-dependent periodic complexity. Time-independent real complexity is equivalent to the information content, which is a measure of a probability of achieving functional requirements. Time-independent imaginary complexity is defined as the uncertainty due to ignorance of the interactions between functional requirements and design parameters. Time-dependent complexity consists of combinatorial complexity and periodic complexity, depending on whether the uncertainty increases indefinitely or occasionally stops increasing at certain point and returns to the initial level of uncertainty. In this thesis, existing definitions for each of the types of complexity are further elaborated with a focus on time-dependent complexity. In particular, time-dependent complexity is clearly defined using the concepts of time-varying system ranges and time-dependent sets of functional requirements.
(cont.) Clear definition of the complexity concept that properly addresses the causes of complexity leads to a systematic approach for complexity reduction. As techniques for reducing time-independent complexity are known within and beyond axiomatic design theory, this thesis focuses on dealing with time-dependent complexity. From the definition of time-dependent complexity, combinatorial complexity must be transformed into periodic complexity to prevent the uncertainty from growing unboundedly. Time-dependence of complexity is attributed to two factors. One is a time-varying system range and the other is a time-dependent set of functional requirements. This thesis shows that achieving periodicity in time-varying system ranges and maintaining functional periodicity of time-dependent sets of functional requirements prevent a system from developing time-dependent combinatorial complexity. Following this argument, a re-initialization concept as a means to achieve and maintain periodicity is presented. Three examples are drawn from different fields, tribology, manufacturing system, and the cell biology, to support the periodicity argument and illustrate the re-initialization concept.
by Taesik Lee.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
9

Colijn, Caroline. "Addressing complexity, exploring social change through chaos and complexity theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq43374.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Causley, Trisha Kathleen. "Complexity and markedness in optimality theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0004/NQ41121.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Complexity theory"

1

Hartmanis, Juris, ed. Computational Complexity Theory. Providence, Rhode Island: American Mathematical Society, 1989. http://dx.doi.org/10.1090/psapm/038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Selman, Alan L., ed. Complexity Theory Retrospective. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4612-4478-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bürgisser, Peter, Michael Clausen, and Mohammad Amin Shokrollahi. Algebraic Complexity Theory. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-662-03338-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Steven, Rudich, and Wigderson Avi, eds. Computational complexity theory. [Providence, R.I.]: American Mathematical Society, Institute for Advanced Study, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Parallel complexity theory. London: Pitman, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Peter, Bürgisser. Algebraic complexity theory. Berlin: Springer, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Arslanov, Marat M., and Steffen Lempp, eds. Recursion Theory and Complexity. Berlin, Boston: DE GRUYTER, 1999. http://dx.doi.org/10.1515/9783110807486.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Abu-Mostafa, Yaser S. Complexity in Information Theory. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-3774-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hemaspaandra, Lane A., and Alan L. Selman, eds. Complexity Theory Retrospective II. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1872-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Complexity theory"

1

Lee, William H. K. "Complexity Theory." In Encyclopedia of Natural Hazards, 117–18. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-1-4020-4399-4_73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aho, Alfred V. "Complexity Theory." In Computer Science, 241–67. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1168-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rosenberg, Arnold L. "Complexity Theory." In The Pillars of Computation Theory, 245–97. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-09639-1_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Krantz, Steven G. "Complexity Theory." In Handbook of Logic and Proof Techniques for Computer Science, 145–65. Boston, MA: Birkhäuser Boston, 2002. http://dx.doi.org/10.1007/978-1-4612-0115-1_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shparlinski, Igor. "Complexity Theory." In Cryptographic Applications of Analytic Number Theory, 103–6. Basel: Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-8037-4_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hidary, Jack D. "Complexity Theory." In Quantum Computing: An Applied Approach, 37–44. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23922-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pinedo, Michael L. "Complexity Theory." In Scheduling, 589–602. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4614-2361-4_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rosenberg, Arnold L., and Lenwood S. Heath. "Complexity Theory." In Texts in Computer Science, 377–444. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10055-0_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hidary, Jack D. "Complexity Theory." In Quantum Computing: An Applied Approach, 43–50. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83274-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dixon, Andrew. "Complexity Theory." In Practical Guide to IT Problem Management, 21–26. Boca Raton: Auerbach Publications, 2022. http://dx.doi.org/10.1201/9781003119975-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Complexity theory"

1

Bernstein, Ethan, and Umesh Vazirani. "Quantum complexity theory." In the twenty-fifth annual ACM symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/167088.167097.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Steiglitz, Kenneth. "Analog Complexity Theory †." In Optical Computing. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/optcomp.1987.tub1.

Full text
Abstract:
Digital computing algorithms are analyzed using a simple and abstract model for computation: the Turing Machine, or close equivalents. The simplicity of the model makes it possible to measure complexity in terms of only two resources — time and space, and allows us to use asymptotics without concern for noise or the breakdown of physical laws. Analyzing the complexity of analog computation is more difficult because of the modeling problem, and the theory and technique are at an earlier stage of development. In this talk we will discuss this theory, and give some examples of its application. Much of the discussion is based on [1].
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Damayanti, Retno Wulan, Budi Hartono, and Andi Rahadiyan Wijaya. "Megaproject Complexity: Conceptual Study from Complexity Theory." In 2019 IEEE 6th International Conference on Engineering Technologies and Applied Sciences (ICETAS). IEEE, 2019. http://dx.doi.org/10.1109/icetas48360.2019.9117337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Jian-er, and Chee-Keng Yap. "Reversal Complexity: (Extended Abstract)." In Proceeding Structure in Complexity Theory. IEEE, 1987. http://dx.doi.org/10.1109/psct.1987.10319249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"Structure in Complexity Theory Conference Organization." In Proceeding Structure in Complexity Theory. IEEE, 1987. http://dx.doi.org/10.1109/psct.1987.10319244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Burgisser, Peter. "Prospects for Geometric Complexity Theory." In 2012 IEEE Conference on Computational Complexity (CCC). IEEE, 2012. http://dx.doi.org/10.1109/ccc.2012.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schöning, Uwe. "Probabilistic Complexity Classes and Lowness." In Proceeding Structure in Complexity Theory. IEEE, 1987. http://dx.doi.org/10.1109/psct.1987.10319246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Buss, Jonathan F. "A Theory of Oracle Machines: (Preliminary version)." In Proceeding Structure in Complexity Theory. IEEE, 1987. http://dx.doi.org/10.1109/psct.1987.10319268.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Complexity theory"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Moffat, James. Complexity Theory and Network Centric Warfare. Fort Belvoir, VA: Defense Technical Information Center, September 2003. http://dx.doi.org/10.21236/ada457288.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Berman, Piotr, Georg Schnitger, and Ian Parberry. A Complexity Theory of Neural Networks. Fort Belvoir, VA: Defense Technical Information Center, August 1991. http://dx.doi.org/10.21236/ada241807.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schapire, Robert E. The Emerging Theory of Average-Case Complexity. Fort Belvoir, VA: Defense Technical Information Center, June 1990. http://dx.doi.org/10.21236/ada222821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Parlett, Beresford. Some Basic Information on Information-Based Complexity Theory. Fort Belvoir, VA: Defense Technical Information Center, July 1989. http://dx.doi.org/10.21236/ada256585.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Marathe, M. V., H. B. III Hunt, R. E. Stearns, and D. J. Rosenkrantz. Theory of periodically specified problems: Complexity and approximability. Office of Scientific and Technical Information (OSTI), December 1997. http://dx.doi.org/10.2172/587665.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Соловйов, Володимир Миколайович, Наталя Володимирівна Моісеєнко, and Олена Юріївна Тарасова. Complexity theory and dynamic characteristics of cognitive processes. Springer, January 2020. http://dx.doi.org/10.31812/123456789/4143.

Full text
Abstract:
The features of modeling of the cognitive component of social and humanitarian systems have been considered. An example of using entropy multiscale, multifractal, recurrence and network complexity measures has shown that these and other synergetic models and methods allow us to correctly describe the quantitative differences of cognitive systems. The cognitive process is proposed to be regarded as a separate implementation of an individual cognitive trajectory, which can be represented as a time series and to investigate its static and dynamic features by the methods of complexity theory. Prognostic possibilities of the complex systems theory will allow to correct the corresponding pedagogical technologies. It has been proposed to track and quantitatively describe the cognitive trajectory using specially transformed computer games which can be used to test the processual characteristics of thinking.
APA, Harvard, Vancouver, ISO, and other styles
8

Soloviev, Vladimir, Natalia Moiseienko, and Olena Tarasova. Modeling of cognitive process using complexity theory methods. [б. в.], 2019. http://dx.doi.org/10.31812/123456789/3609.

Full text
Abstract:
The features of modeling of the cognitive component of social and humanitarian systems have been considered. An example of using multiscale, multifractal and network complexity measures has shown that these and other synergetic models and methods allow us to correctly describe the quantitative differences of cognitive systems. The cognitive process is proposed to be regarded as a separate implementation of an individual cognitive trajectory, which can be represented as a time series and to investigate its static and dynamic features by the methods of complexity theory. Prognostic possibilities of the complex systems theory will allow to correct the corresponding pedagogical technologies.
APA, Harvard, Vancouver, ISO, and other styles
9

Jordan, Stephen P. Quantum Complexity Theory and High Energy Physics (Final Report). Office of Scientific and Technical Information (OSTI), October 2018. http://dx.doi.org/10.2172/1479109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Piloto Rodríguez, JA, OR González Martín, H. Saladrigas Medina, and Y. León del Río. The USSR discourse: an analysis based on the complexity theory. Revista Latina de Comunicación Social, October 2015. http://dx.doi.org/10.4185/rlcs-2015-1064en.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Complexity theory' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography