Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Complexity theory)`

.
Showing records 1 – 30 of
579 total matches.

◁ [1] [2] [3] [4] [5] … [20] ▶

Search Limiters

Dates

- 2016 – 2020 (164)
- 2011 – 2015 (249)
- 2006 – 2010 (142)
- 2001 – 2005 (45)
- 1996 – 2000 (11)

Universities

- ETH Zürich (24)
- University of São Paulo (14)
- Nanyang Technological University (12)
- University of Waterloo (11)
- Texas A&M University (10)

Department

- Informatique (14)
- Computer Science (10)

Degrees

- PhD (158)
- Docteur es (27)
- MS (12)
- MA (10)

Languages

- English (314)
- Portuguese (43)
- French (14)
- Swedish (12)

Country

- US (179)
- Canada (59)
- Brazil (48)
- Australia (44)
- UK (40)
- France (27)
- Switzerland (25)
- New Zealand (24)
- Sweden (24)
- Netherlands (22)
- South Africa (21)
- Singapore (14)

▼ Search Limiters

1. Ämin, Baumeler. Causal loops: logically consistent correlations, time travel, and computation.

Degree: 2017, Università della Svizzera italiana

URL: http://doc.rero.ch/record/288417

► Causal loops are loops in cause-effect chains: An effect can be the cause of that effect's cause. We show that causal loops can be unproblematic,…
(more)

Subjects/Keywords: Complexity theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ämin, B. (2017). Causal loops: logically consistent correlations, time travel, and computation. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/288417

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ämin, Baumeler. “Causal loops: logically consistent correlations, time travel, and computation.” 2017. Thesis, Università della Svizzera italiana. Accessed September 20, 2020. http://doc.rero.ch/record/288417.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ämin, Baumeler. “Causal loops: logically consistent correlations, time travel, and computation.” 2017. Web. 20 Sep 2020.

Vancouver:

Ämin B. Causal loops: logically consistent correlations, time travel, and computation. [Internet] [Thesis]. Università della Svizzera italiana; 2017. [cited 2020 Sep 20]. Available from: http://doc.rero.ch/record/288417.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ämin B. Causal loops: logically consistent correlations, time travel, and computation. [Thesis]. Università della Svizzera italiana; 2017. Available from: http://doc.rero.ch/record/288417

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

2.
Garg, Ankit.
Information Theoretic Relaxations in *Complexity* * Theory*
.

Degree: PhD, 2016, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p

► Since Shannon’s “A Mathematical *Theory* of Communication”, information *theory* has found applicability in a wide range of scientific disciplines. Over the past two decades, information…
(more)

Subjects/Keywords: Communication Complexity; Complexity Theory; Information Complexity

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Garg, A. (2016). Information Theoretic Relaxations in Complexity Theory . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p

Chicago Manual of Style (16^{th} Edition):

Garg, Ankit. “Information Theoretic Relaxations in Complexity Theory .” 2016. Doctoral Dissertation, Princeton University. Accessed September 20, 2020. http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p.

MLA Handbook (7^{th} Edition):

Garg, Ankit. “Information Theoretic Relaxations in Complexity Theory .” 2016. Web. 20 Sep 2020.

Vancouver:

Garg A. Information Theoretic Relaxations in Complexity Theory . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2020 Sep 20]. Available from: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p.

Council of Science Editors:

Garg A. Information Theoretic Relaxations in Complexity Theory . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p

University of Toronto

3. Robere, Robert Charles. Unified Lower Bounds for Monotone Computation.

Degree: PhD, 2018, University of Toronto

URL: http://hdl.handle.net/1807/92007

► Razborov introduced an elegant rank-based *complexity* measure for proving lower bounds on the monotone formula *complexity* of boolean functions. Later work by Gal showed that…
(more)

Subjects/Keywords: boolean circuits; circuit complexity; complexity theory; proof complexity; span programs; 0984

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Robere, R. C. (2018). Unified Lower Bounds for Monotone Computation. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/92007

Chicago Manual of Style (16^{th} Edition):

Robere, Robert Charles. “Unified Lower Bounds for Monotone Computation.” 2018. Doctoral Dissertation, University of Toronto. Accessed September 20, 2020. http://hdl.handle.net/1807/92007.

MLA Handbook (7^{th} Edition):

Robere, Robert Charles. “Unified Lower Bounds for Monotone Computation.” 2018. Web. 20 Sep 2020.

Vancouver:

Robere RC. Unified Lower Bounds for Monotone Computation. [Internet] [Doctoral dissertation]. University of Toronto; 2018. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1807/92007.

Council of Science Editors:

Robere RC. Unified Lower Bounds for Monotone Computation. [Doctoral Dissertation]. University of Toronto; 2018. Available from: http://hdl.handle.net/1807/92007

University of Sydney

4.
Hansen, Claire Gwendoline.
Shakespeare and *Complexity* * Theory*
.

Degree: 2015, University of Sydney

URL: http://hdl.handle.net/2123/13667

► 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…
(more)

Subjects/Keywords: Shakespeare; complexity theory; systems

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hansen, C. G. (2015). Shakespeare and Complexity Theory . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/13667

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hansen, Claire Gwendoline. “Shakespeare and Complexity Theory .” 2015. Thesis, University of Sydney. Accessed September 20, 2020. http://hdl.handle.net/2123/13667.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hansen, Claire Gwendoline. “Shakespeare and Complexity Theory .” 2015. Web. 20 Sep 2020.

Vancouver:

Hansen CG. Shakespeare and Complexity Theory . [Internet] [Thesis]. University of Sydney; 2015. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/2123/13667.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hansen CG. Shakespeare and Complexity Theory . [Thesis]. University of Sydney; 2015. Available from: http://hdl.handle.net/2123/13667

Not specified: Masters Thesis or Doctoral Dissertation

5. Lawson, Austin. Multi-scale persistent homology.

Degree: 2016, NC Docks

URL: http://libres.uncg.edu/ir/uncg/f/Lawson_uncg_0154M_11951.pdf

► Data has shape and that shape is important. This is the anthem of Topological Data Analysis (TDA) as often stated by Gunnar Carlsson. In this…
(more)

Subjects/Keywords: Homology theory; Computational complexity; Topology

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lawson, A. (2016). Multi-scale persistent homology. (Thesis). NC Docks. Retrieved from http://libres.uncg.edu/ir/uncg/f/Lawson_uncg_0154M_11951.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lawson, Austin. “Multi-scale persistent homology.” 2016. Thesis, NC Docks. Accessed September 20, 2020. http://libres.uncg.edu/ir/uncg/f/Lawson_uncg_0154M_11951.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lawson, Austin. “Multi-scale persistent homology.” 2016. Web. 20 Sep 2020.

Vancouver:

Lawson A. Multi-scale persistent homology. [Internet] [Thesis]. NC Docks; 2016. [cited 2020 Sep 20]. Available from: http://libres.uncg.edu/ir/uncg/f/Lawson_uncg_0154M_11951.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lawson A. Multi-scale persistent homology. [Thesis]. NC Docks; 2016. Available from: http://libres.uncg.edu/ir/uncg/f/Lawson_uncg_0154M_11951.pdf

Not specified: Masters Thesis or Doctoral Dissertation

University of North Carolina – Greensboro

6. Lawson, Austin. Multi-scale persistent homology.

Degree: 2016, University of North Carolina – Greensboro

URL: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=19722

► Data has shape and that shape is important. This is the anthem of Topological Data Analysis (TDA) as often stated by Gunnar Carlsson. In this…
(more)

Subjects/Keywords: Homology theory; Computational complexity; Topology

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lawson, A. (2016). Multi-scale persistent homology. (Masters Thesis). University of North Carolina – Greensboro. Retrieved from http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=19722

Chicago Manual of Style (16^{th} Edition):

Lawson, Austin. “Multi-scale persistent homology.” 2016. Masters Thesis, University of North Carolina – Greensboro. Accessed September 20, 2020. http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=19722.

MLA Handbook (7^{th} Edition):

Lawson, Austin. “Multi-scale persistent homology.” 2016. Web. 20 Sep 2020.

Vancouver:

Lawson A. Multi-scale persistent homology. [Internet] [Masters thesis]. University of North Carolina – Greensboro; 2016. [cited 2020 Sep 20]. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=19722.

Council of Science Editors:

Lawson A. Multi-scale persistent homology. [Masters Thesis]. University of North Carolina – Greensboro; 2016. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=19722

University of Victoria

7.
Duffy, Christopher.
A collection of algorithmic and *complexity* results for variants of the Firefighter Problem.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

URL: http://hdl.handle.net/1828/3550

► The Firefighter Process models the spread and defence of a fire using a simple graph. We consider the following discrete-time process: at t = 0…
(more)

Subjects/Keywords: Graph Theory; Complexity; Firefighter

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Duffy, C. (2011). A collection of algorithmic and complexity results for variants of the Firefighter Problem. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3550

Chicago Manual of Style (16^{th} Edition):

Duffy, Christopher. “A collection of algorithmic and complexity results for variants of the Firefighter Problem.” 2011. Masters Thesis, University of Victoria. Accessed September 20, 2020. http://hdl.handle.net/1828/3550.

MLA Handbook (7^{th} Edition):

Duffy, Christopher. “A collection of algorithmic and complexity results for variants of the Firefighter Problem.” 2011. Web. 20 Sep 2020.

Vancouver:

Duffy C. A collection of algorithmic and complexity results for variants of the Firefighter Problem. [Internet] [Masters thesis]. University of Victoria; 2011. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1828/3550.

Council of Science Editors:

Duffy C. A collection of algorithmic and complexity results for variants of the Firefighter Problem. [Masters Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3550

University of Illinois – Urbana-Champaign

8. Insana, Lindsay Anne E. Understanding adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system.

Degree: PhD, Curriculum and Instruction, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/78474

► This study explored adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system. Adaptive teaching is a concept that has been studied;…
(more)

Subjects/Keywords: complexity theory; adaptive teaching

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Insana, L. A. E. (2015). Understanding adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78474

Chicago Manual of Style (16^{th} Edition):

Insana, Lindsay Anne E. “Understanding adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 20, 2020. http://hdl.handle.net/2142/78474.

MLA Handbook (7^{th} Edition):

Insana, Lindsay Anne E. “Understanding adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system.” 2015. Web. 20 Sep 2020.

Vancouver:

Insana LAE. Understanding adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/2142/78474.

Council of Science Editors:

Insana LAE. Understanding adaptive teaching expertise in an elementary classroom viewed as a complex adaptive system. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78474

Clemson University

9. Bright, Margaret. An Examination of Adaptive Leadership Processes Using Action Research.

Degree: PhD, Educational Leadership, 2011, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/857

► School districts are knowledge producing organizations faced with adaptive challenges that require new learning, innovation, and new patterns of behavior. Traditional, entity-based models of leadership…
(more)

Subjects/Keywords: Adaptive leadership; Administrative leadership; Complexity leadership theory; Complexity mechanisms; Complexity theory; Enabling leadership; Educational Leadership

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bright, M. (2011). An Examination of Adaptive Leadership Processes Using Action Research. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/857

Chicago Manual of Style (16^{th} Edition):

Bright, Margaret. “An Examination of Adaptive Leadership Processes Using Action Research.” 2011. Doctoral Dissertation, Clemson University. Accessed September 20, 2020. https://tigerprints.clemson.edu/all_dissertations/857.

MLA Handbook (7^{th} Edition):

Bright, Margaret. “An Examination of Adaptive Leadership Processes Using Action Research.” 2011. Web. 20 Sep 2020.

Vancouver:

Bright M. An Examination of Adaptive Leadership Processes Using Action Research. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2020 Sep 20]. Available from: https://tigerprints.clemson.edu/all_dissertations/857.

Council of Science Editors:

Bright M. An Examination of Adaptive Leadership Processes Using Action Research. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/857

Rochester Institute of Technology

10. Menton, Curtis. Range voting is resistant to control.

Degree: Computer Science (GCCIS), 2009, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/326

► Social choice *theory* is concerned with developing and evaluating voting systems, both for the use of political and organizational elections and for use as decision…
(more)

Subjects/Keywords: Complexity theory; Computational social choice; Voting theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Menton, C. (2009). Range voting is resistant to control. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/326

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Menton, Curtis. “Range voting is resistant to control.” 2009. Thesis, Rochester Institute of Technology. Accessed September 20, 2020. https://scholarworks.rit.edu/theses/326.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Menton, Curtis. “Range voting is resistant to control.” 2009. Web. 20 Sep 2020.

Vancouver:

Menton C. Range voting is resistant to control. [Internet] [Thesis]. Rochester Institute of Technology; 2009. [cited 2020 Sep 20]. Available from: https://scholarworks.rit.edu/theses/326.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Menton C. Range voting is resistant to control. [Thesis]. Rochester Institute of Technology; 2009. Available from: https://scholarworks.rit.edu/theses/326

Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

11. Louth, Jonathon. Imagining a complex world: science, order and international relations.

Degree: 2010, University of Adelaide

URL: http://hdl.handle.net/2440/64044

► How order is understood has been a central preoccupation of international relations *theory*. Within the Western imagination, order, banishing chaos, emerged from the Scientific Revolution…
(more)

Subjects/Keywords: international relations theory; complexity theory; order

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Louth, J. (2010). Imagining a complex world: science, order and international relations. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/64044

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Louth, Jonathon. “Imagining a complex world: science, order and international relations.” 2010. Thesis, University of Adelaide. Accessed September 20, 2020. http://hdl.handle.net/2440/64044.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Louth, Jonathon. “Imagining a complex world: science, order and international relations.” 2010. Web. 20 Sep 2020.

Vancouver:

Louth J. Imagining a complex world: science, order and international relations. [Internet] [Thesis]. University of Adelaide; 2010. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/2440/64044.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Louth J. Imagining a complex world: science, order and international relations. [Thesis]. University of Adelaide; 2010. Available from: http://hdl.handle.net/2440/64044

Not specified: Masters Thesis or Doctoral Dissertation

12.
Cloete, Gideon Stephanus.
Towards re-imagining the roles of change agents from a critical *complexity* perspective : an exploratory action research approach.

Degree: PhD, 2017, Stellenbosch University

URL: http://hdl.handle.net/10019.1/102961

► ENGLISH SUMMARY : Research on the theoretical conceptualisations and research methods informing current change agency *theory* and practice in the field of Organisation *Theory* (OT)…
(more)

Subjects/Keywords: Change management; Organizational change; Change agents; Complexity theory; Complexity thinking; UCTD

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Cloete, G. S. (2017). Towards re-imagining the roles of change agents from a critical complexity perspective : an exploratory action research approach. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/102961

Chicago Manual of Style (16^{th} Edition):

Cloete, Gideon Stephanus. “Towards re-imagining the roles of change agents from a critical complexity perspective : an exploratory action research approach.” 2017. Doctoral Dissertation, Stellenbosch University. Accessed September 20, 2020. http://hdl.handle.net/10019.1/102961.

MLA Handbook (7^{th} Edition):

Cloete, Gideon Stephanus. “Towards re-imagining the roles of change agents from a critical complexity perspective : an exploratory action research approach.” 2017. Web. 20 Sep 2020.

Vancouver:

Cloete GS. Towards re-imagining the roles of change agents from a critical complexity perspective : an exploratory action research approach. [Internet] [Doctoral dissertation]. Stellenbosch University; 2017. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10019.1/102961.

Council of Science Editors:

Cloete GS. Towards re-imagining the roles of change agents from a critical complexity perspective : an exploratory action research approach. [Doctoral Dissertation]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/102961

Penn State University

13.
Hudelson, William.
Partial randomness and Kolmogorov * complexity*.

Degree: 2013, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/17456

► Algorithmic randomness and Kolmogorov *complexity* provide a computational framework for the study of probability *theory* and information *theory*. In this dissertation we prove the following…
(more)

Subjects/Keywords: randomness; algorithmic randomness; complexity; Kolmogorov complexity; computability; recursion theory; mathematical logic

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hudelson, W. (2013). Partial randomness and Kolmogorov complexity. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/17456

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hudelson, William. “Partial randomness and Kolmogorov complexity.” 2013. Thesis, Penn State University. Accessed September 20, 2020. https://submit-etda.libraries.psu.edu/catalog/17456.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hudelson, William. “Partial randomness and Kolmogorov complexity.” 2013. Web. 20 Sep 2020.

Vancouver:

Hudelson W. Partial randomness and Kolmogorov complexity. [Internet] [Thesis]. Penn State University; 2013. [cited 2020 Sep 20]. Available from: https://submit-etda.libraries.psu.edu/catalog/17456.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hudelson W. Partial randomness and Kolmogorov complexity. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/17456

Not specified: Masters Thesis or Doctoral Dissertation

14.
Zeume, Thomas.
Small dynamic *complexity* classes.

Degree: 2015, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-7806

► The re-evaluation of a query result after modifying a large database can be a time-consuming process; in particular when it is performed from scratch. For…
(more)

Subjects/Keywords: Dynamic complexity theory; Descriptive complexity; Incremental view maintenance; 004

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zeume, T. (2015). Small dynamic complexity classes. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-7806

Chicago Manual of Style (16^{th} Edition):

Zeume, Thomas. “Small dynamic complexity classes.” 2015. Doctoral Dissertation, Technische Universität Dortmund. Accessed September 20, 2020. http://dx.doi.org/10.17877/DE290R-7806.

MLA Handbook (7^{th} Edition):

Zeume, Thomas. “Small dynamic complexity classes.” 2015. Web. 20 Sep 2020.

Vancouver:

Zeume T. Small dynamic complexity classes. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2015. [cited 2020 Sep 20]. Available from: http://dx.doi.org/10.17877/DE290R-7806.

Council of Science Editors:

Zeume T. Small dynamic complexity classes. [Doctoral Dissertation]. Technische Universität Dortmund; 2015. Available from: http://dx.doi.org/10.17877/DE290R-7806

15. Vortmeier, Nils. Dynamic expressibility under complex changes.

Degree: 2019, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-20434

► Whenever a database is changed, any previously computed and stored result of a query evaluation on that database becomes invalid and needs to be updated.…
(more)

Subjects/Keywords: Dynamic complexity theory; Descriptive complexity; DynFO; Complex changes; 004; Komplexität; Komplexitätstheorie

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Vortmeier, N. (2019). Dynamic expressibility under complex changes. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-20434

Chicago Manual of Style (16^{th} Edition):

Vortmeier, Nils. “Dynamic expressibility under complex changes.” 2019. Doctoral Dissertation, Technische Universität Dortmund. Accessed September 20, 2020. http://dx.doi.org/10.17877/DE290R-20434.

MLA Handbook (7^{th} Edition):

Vortmeier, Nils. “Dynamic expressibility under complex changes.” 2019. Web. 20 Sep 2020.

Vancouver:

Vortmeier N. Dynamic expressibility under complex changes. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2019. [cited 2020 Sep 20]. Available from: http://dx.doi.org/10.17877/DE290R-20434.

Council of Science Editors:

Vortmeier N. Dynamic expressibility under complex changes. [Doctoral Dissertation]. Technische Universität Dortmund; 2019. Available from: http://dx.doi.org/10.17877/DE290R-20434

University of Bradford

16.
Romano, Arthur.
Educating on the edge of chaos : using *complexity* *theory* to examine pedagogical responses to global *complexity* by peace educators.

Degree: PhD, 2012, University of Bradford

URL: http://hdl.handle.net/10454/5725

► This dissertation examines the nexus of *complexity* *theory* and peace education and its implications for developing educational praxis that engages with the demands of global…
(more)

Subjects/Keywords: 303.6; Complexity theory; Peace education; International education; Global complexity; Educational sociology

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Romano, A. (2012). Educating on the edge of chaos : using complexity theory to examine pedagogical responses to global complexity by peace educators. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/5725

Chicago Manual of Style (16^{th} Edition):

Romano, Arthur. “Educating on the edge of chaos : using complexity theory to examine pedagogical responses to global complexity by peace educators.” 2012. Doctoral Dissertation, University of Bradford. Accessed September 20, 2020. http://hdl.handle.net/10454/5725.

MLA Handbook (7^{th} Edition):

Romano, Arthur. “Educating on the edge of chaos : using complexity theory to examine pedagogical responses to global complexity by peace educators.” 2012. Web. 20 Sep 2020.

Vancouver:

Romano A. Educating on the edge of chaos : using complexity theory to examine pedagogical responses to global complexity by peace educators. [Internet] [Doctoral dissertation]. University of Bradford; 2012. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10454/5725.

Council of Science Editors:

Romano A. Educating on the edge of chaos : using complexity theory to examine pedagogical responses to global complexity by peace educators. [Doctoral Dissertation]. University of Bradford; 2012. Available from: http://hdl.handle.net/10454/5725

University of Toronto

17. Fontes, Lila A. Trading Privacy for Communication.

Degree: PhD, 2014, University of Toronto

URL: http://hdl.handle.net/1807/94480

► There is a long history of the study of information-theoretic privacy within the context of communication *complexity*. Unfortunately, it has been shown that most interesting…
(more)

Subjects/Keywords: communication complexity; complexity; information theory; lower bound; privacy; tradeoff; 0984

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Fontes, L. A. (2014). Trading Privacy for Communication. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/94480

Chicago Manual of Style (16^{th} Edition):

Fontes, Lila A. “Trading Privacy for Communication.” 2014. Doctoral Dissertation, University of Toronto. Accessed September 20, 2020. http://hdl.handle.net/1807/94480.

MLA Handbook (7^{th} Edition):

Fontes, Lila A. “Trading Privacy for Communication.” 2014. Web. 20 Sep 2020.

Vancouver:

Fontes LA. Trading Privacy for Communication. [Internet] [Doctoral dissertation]. University of Toronto; 2014. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1807/94480.

Council of Science Editors:

Fontes LA. Trading Privacy for Communication. [Doctoral Dissertation]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/94480

Clemson University

18.
Mathieson, James.
Connective *Complexity* Methods for Analysis and Prediction in Engineering Design.

Degree: MS, Mechanical Engineering, 2011, Clemson University

URL: https://tigerprints.clemson.edu/all_theses/1085

► *Complexity* is an aspect of engineering design that is often addressed directly with the principle that 'designs should be simple'. However, such a principle…
(more)

Subjects/Keywords: Complexity; Complexity Measurement; Graph Theory; Performance Prediction; Mechanical Engineering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Mathieson, J. (2011). Connective Complexity Methods for Analysis and Prediction in Engineering Design. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/1085

Chicago Manual of Style (16^{th} Edition):

Mathieson, James. “Connective Complexity Methods for Analysis and Prediction in Engineering Design.” 2011. Masters Thesis, Clemson University. Accessed September 20, 2020. https://tigerprints.clemson.edu/all_theses/1085.

MLA Handbook (7^{th} Edition):

Mathieson, James. “Connective Complexity Methods for Analysis and Prediction in Engineering Design.” 2011. Web. 20 Sep 2020.

Vancouver:

Mathieson J. Connective Complexity Methods for Analysis and Prediction in Engineering Design. [Internet] [Masters thesis]. Clemson University; 2011. [cited 2020 Sep 20]. Available from: https://tigerprints.clemson.edu/all_theses/1085.

Council of Science Editors:

Mathieson J. Connective Complexity Methods for Analysis and Prediction in Engineering Design. [Masters Thesis]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_theses/1085

University of Arkansas

19.
Apon, Daniel Christopher.
On the *Complexity* of Grid Coloring.

Degree: MS, 2011, University of Arkansas

URL: https://scholarworks.uark.edu/etd/108

► This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational *complexity*, and communication *complexity*. The prototypical example of such a problem is Monochromatic-Rectangle-Free…
(more)

Subjects/Keywords: Communication complexity; Computational complexity; High-performance computing; Ramsey theory; Computer Engineering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Apon, D. C. (2011). On the Complexity of Grid Coloring. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/108

Chicago Manual of Style (16^{th} Edition):

Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Masters Thesis, University of Arkansas. Accessed September 20, 2020. https://scholarworks.uark.edu/etd/108.

MLA Handbook (7^{th} Edition):

Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Web. 20 Sep 2020.

Vancouver:

Apon DC. On the Complexity of Grid Coloring. [Internet] [Masters thesis]. University of Arkansas; 2011. [cited 2020 Sep 20]. Available from: https://scholarworks.uark.edu/etd/108.

Council of Science Editors:

Apon DC. On the Complexity of Grid Coloring. [Masters Thesis]. University of Arkansas; 2011. Available from: https://scholarworks.uark.edu/etd/108

University of Manchester

20. Fenner, Peter John. Some algorithmic problems in monoids of Boolean matrices.

Degree: 2018, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

► A Boolean matrix is a matrix with elements from the Boolean semiring ({0, 1}, +, x), where the addition and multiplication are as usual with…
(more)

Subjects/Keywords: semigroup theory; computational complexity; Boolean matrices

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Fenner, P. J. (2018). Some algorithmic problems in monoids of Boolean matrices. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

Chicago Manual of Style (16^{th} Edition):

Fenner, Peter John. “Some algorithmic problems in monoids of Boolean matrices.” 2018. Doctoral Dissertation, University of Manchester. Accessed September 20, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995.

MLA Handbook (7^{th} Edition):

Fenner, Peter John. “Some algorithmic problems in monoids of Boolean matrices.” 2018. Web. 20 Sep 2020.

Vancouver:

Fenner PJ. Some algorithmic problems in monoids of Boolean matrices. [Internet] [Doctoral dissertation]. University of Manchester; 2018. [cited 2020 Sep 20]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995.

Council of Science Editors:

Fenner PJ. Some algorithmic problems in monoids of Boolean matrices. [Doctoral Dissertation]. University of Manchester; 2018. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

Purdue University

21.
Concu, Valentina.
The Historical Evolution of the German Present Perfect from the Perspective of *Complexity* *Theory* and Emergent Grammar.

Degree: MA, Languages and Cultures, 2015, Purdue University

URL: https://docs.lib.purdue.edu/open_access_theses/1174

► The purpose of this study is to understand the meaning of the present perfect in Modern German and also, to trace its development in the…
(more)

Subjects/Keywords: Complexity Theory; Emergent Grammar; Grammaticalisation; Present Perfect

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Concu, V. (2015). The Historical Evolution of the German Present Perfect from the Perspective of Complexity Theory and Emergent Grammar. (Thesis). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_theses/1174

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Concu, Valentina. “The Historical Evolution of the German Present Perfect from the Perspective of Complexity Theory and Emergent Grammar.” 2015. Thesis, Purdue University. Accessed September 20, 2020. https://docs.lib.purdue.edu/open_access_theses/1174.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Concu, Valentina. “The Historical Evolution of the German Present Perfect from the Perspective of Complexity Theory and Emergent Grammar.” 2015. Web. 20 Sep 2020.

Vancouver:

Concu V. The Historical Evolution of the German Present Perfect from the Perspective of Complexity Theory and Emergent Grammar. [Internet] [Thesis]. Purdue University; 2015. [cited 2020 Sep 20]. Available from: https://docs.lib.purdue.edu/open_access_theses/1174.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Concu V. The Historical Evolution of the German Present Perfect from the Perspective of Complexity Theory and Emergent Grammar. [Thesis]. Purdue University; 2015. Available from: https://docs.lib.purdue.edu/open_access_theses/1174

Not specified: Masters Thesis or Doctoral Dissertation

University of Ghana

22.
Tetteh, G.
Assessing Flooding Experiences in the Ga South Municipality Using the *Complexity* * Theory*
.

Degree: 2017, University of Ghana

URL: http://ugspace.ug.edu.gh/handle/123456789/24671

► The current state-of-the-art in flood persistence and damage analysis mainly focuses on the economic evaluation of tangible flood effects, although prior studies have revealed that…
(more)

Subjects/Keywords: Assessing Flooding; GA South Municipality; Complexity Theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tetteh, G. (2017). Assessing Flooding Experiences in the Ga South Municipality Using the Complexity Theory . (Masters Thesis). University of Ghana. Retrieved from http://ugspace.ug.edu.gh/handle/123456789/24671

Chicago Manual of Style (16^{th} Edition):

Tetteh, G. “Assessing Flooding Experiences in the Ga South Municipality Using the Complexity Theory .” 2017. Masters Thesis, University of Ghana. Accessed September 20, 2020. http://ugspace.ug.edu.gh/handle/123456789/24671.

MLA Handbook (7^{th} Edition):

Tetteh, G. “Assessing Flooding Experiences in the Ga South Municipality Using the Complexity Theory .” 2017. Web. 20 Sep 2020.

Vancouver:

Tetteh G. Assessing Flooding Experiences in the Ga South Municipality Using the Complexity Theory . [Internet] [Masters thesis]. University of Ghana; 2017. [cited 2020 Sep 20]. Available from: http://ugspace.ug.edu.gh/handle/123456789/24671.

Council of Science Editors:

Tetteh G. Assessing Flooding Experiences in the Ga South Municipality Using the Complexity Theory . [Masters Thesis]. University of Ghana; 2017. Available from: http://ugspace.ug.edu.gh/handle/123456789/24671

University of Vermont

23.
Steele, Caitlin S.
Education in the Age of *Complexity*: Building Systems Literacy.

Degree: PhD, Educational Leadership and Policy Studies, 2016, University of Vermont

URL: https://scholarworks.uvm.edu/graddis/588

► In the 21st century, transdisciplinary approaches to research and problem solving rooted in *complexity* *theory* and complex systems methodologies offer hope for understanding and…
(more)

Subjects/Keywords: complexity; education; grounded theory; systems literacy; Education

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Steele, C. S. (2016). Education in the Age of Complexity: Building Systems Literacy. (Doctoral Dissertation). University of Vermont. Retrieved from https://scholarworks.uvm.edu/graddis/588

Chicago Manual of Style (16^{th} Edition):

Steele, Caitlin S. “Education in the Age of Complexity: Building Systems Literacy.” 2016. Doctoral Dissertation, University of Vermont. Accessed September 20, 2020. https://scholarworks.uvm.edu/graddis/588.

MLA Handbook (7^{th} Edition):

Steele, Caitlin S. “Education in the Age of Complexity: Building Systems Literacy.” 2016. Web. 20 Sep 2020.

Vancouver:

Steele CS. Education in the Age of Complexity: Building Systems Literacy. [Internet] [Doctoral dissertation]. University of Vermont; 2016. [cited 2020 Sep 20]. Available from: https://scholarworks.uvm.edu/graddis/588.

Council of Science Editors:

Steele CS. Education in the Age of Complexity: Building Systems Literacy. [Doctoral Dissertation]. University of Vermont; 2016. Available from: https://scholarworks.uvm.edu/graddis/588

Boston College

24.
Moore, Meredith Cromwell.
A *Complexity* Analysis of Two Teachers’ Learning from
Professional Development: Toward an Explanatory * Theory*.

Degree: PhD, Teacher Education, Special Education, Curriculum and Instruction, 2018, Boston College

URL: http://dlib.bc.edu/islandora/object/bc-ir:108093

► Professional development is widely viewed as a key lever for school change. Each year, federal and state governments pour billions of dollars into developing teachers,…
(more)

Subjects/Keywords: Complexity Theory; Professional Development; Teacher Learning

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Moore, M. C. (2018). A Complexity Analysis of Two Teachers’ Learning from Professional Development: Toward an Explanatory Theory. (Doctoral Dissertation). Boston College. Retrieved from http://dlib.bc.edu/islandora/object/bc-ir:108093

Chicago Manual of Style (16^{th} Edition):

Moore, Meredith Cromwell. “A Complexity Analysis of Two Teachers’ Learning from Professional Development: Toward an Explanatory Theory.” 2018. Doctoral Dissertation, Boston College. Accessed September 20, 2020. http://dlib.bc.edu/islandora/object/bc-ir:108093.

MLA Handbook (7^{th} Edition):

Moore, Meredith Cromwell. “A Complexity Analysis of Two Teachers’ Learning from Professional Development: Toward an Explanatory Theory.” 2018. Web. 20 Sep 2020.

Vancouver:

Moore MC. A Complexity Analysis of Two Teachers’ Learning from Professional Development: Toward an Explanatory Theory. [Internet] [Doctoral dissertation]. Boston College; 2018. [cited 2020 Sep 20]. Available from: http://dlib.bc.edu/islandora/object/bc-ir:108093.

Council of Science Editors:

Moore MC. A Complexity Analysis of Two Teachers’ Learning from Professional Development: Toward an Explanatory Theory. [Doctoral Dissertation]. Boston College; 2018. Available from: http://dlib.bc.edu/islandora/object/bc-ir:108093

Durham University

25. Andriani, Pierpaolo. The emergence of self-organisation in social systems : the case of the geographic industrial clusters.

Degree: PhD, 2003, Durham University

URL: http://etheses.dur.ac.uk/4011/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274006

► The objective of this work is to use *complexity* *theory* to propose a new interpretation of industrial clusters. Industrial clusters constitute a specific type of…
(more)

Subjects/Keywords: 307; Complexity theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Andriani, P. (2003). The emergence of self-organisation in social systems : the case of the geographic industrial clusters. (Doctoral Dissertation). Durham University. Retrieved from http://etheses.dur.ac.uk/4011/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274006

Chicago Manual of Style (16^{th} Edition):

Andriani, Pierpaolo. “The emergence of self-organisation in social systems : the case of the geographic industrial clusters.” 2003. Doctoral Dissertation, Durham University. Accessed September 20, 2020. http://etheses.dur.ac.uk/4011/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274006.

MLA Handbook (7^{th} Edition):

Andriani, Pierpaolo. “The emergence of self-organisation in social systems : the case of the geographic industrial clusters.” 2003. Web. 20 Sep 2020.

Vancouver:

Andriani P. The emergence of self-organisation in social systems : the case of the geographic industrial clusters. [Internet] [Doctoral dissertation]. Durham University; 2003. [cited 2020 Sep 20]. Available from: http://etheses.dur.ac.uk/4011/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274006.

Council of Science Editors:

Andriani P. The emergence of self-organisation in social systems : the case of the geographic industrial clusters. [Doctoral Dissertation]. Durham University; 2003. Available from: http://etheses.dur.ac.uk/4011/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274006

University of Oklahoma

26. Yasuda, Mano. Use of the Target Language in Beginning Japanese.

Degree: PhD, 2019, University of Oklahoma

URL: http://hdl.handle.net/11244/319637

► The purpose of this study was to investigate how two Japanese teachers used the target language (Japanese) and students’ first language (English) in a college-level,…
(more)

Subjects/Keywords: Target language; Complexity theory; Japanese classroom

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yasuda, M. (2019). Use of the Target Language in Beginning Japanese. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319637

Chicago Manual of Style (16^{th} Edition):

Yasuda, Mano. “Use of the Target Language in Beginning Japanese.” 2019. Doctoral Dissertation, University of Oklahoma. Accessed September 20, 2020. http://hdl.handle.net/11244/319637.

MLA Handbook (7^{th} Edition):

Yasuda, Mano. “Use of the Target Language in Beginning Japanese.” 2019. Web. 20 Sep 2020.

Vancouver:

Yasuda M. Use of the Target Language in Beginning Japanese. [Internet] [Doctoral dissertation]. University of Oklahoma; 2019. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/11244/319637.

Council of Science Editors:

Yasuda M. Use of the Target Language in Beginning Japanese. [Doctoral Dissertation]. University of Oklahoma; 2019. Available from: http://hdl.handle.net/11244/319637

University of Victoria

27. Duffy, Christopher. Homomorphisms of (j, k)-mixed graphs.

Degree: Department of Mathematics and Statistics, 2015, University of Victoria

URL: http://hdl.handle.net/1828/6601

► A mixed graph is a simple graph in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j…
(more)

Subjects/Keywords: graph theory; coloring; homomorphism; algorithms; complexity

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Duffy, C. (2015). Homomorphisms of (j, k)-mixed graphs. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6601

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Duffy, Christopher. “Homomorphisms of (j, k)-mixed graphs.” 2015. Thesis, University of Victoria. Accessed September 20, 2020. http://hdl.handle.net/1828/6601.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Duffy, Christopher. “Homomorphisms of (j, k)-mixed graphs.” 2015. Web. 20 Sep 2020.

Vancouver:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1828/6601.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Duffy C. Homomorphisms of (j, k)-mixed graphs. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6601

Not specified: Masters Thesis or Doctoral Dissertation

University of Windsor

28.
Wilson, Deidre Ann.
On the Relationship between *Complexity* *Theory*, Professional Learning, and Lesson Study in Intermediate Mathematics Classrooms.

Degree: PhD, Education, 2015, University of Windsor

URL: https://scholar.uwindsor.ca/etd/5497

► This research adds to the existing knowledge about using the professional learning practice of Lesson Study as a way to build pedagogical knowledge and…
(more)

Subjects/Keywords: complexity theory; lesson study; professional learning

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wilson, D. A. (2015). On the Relationship between Complexity Theory, Professional Learning, and Lesson Study in Intermediate Mathematics Classrooms. (Doctoral Dissertation). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5497

Chicago Manual of Style (16^{th} Edition):

Wilson, Deidre Ann. “On the Relationship between Complexity Theory, Professional Learning, and Lesson Study in Intermediate Mathematics Classrooms.” 2015. Doctoral Dissertation, University of Windsor. Accessed September 20, 2020. https://scholar.uwindsor.ca/etd/5497.

MLA Handbook (7^{th} Edition):

Wilson, Deidre Ann. “On the Relationship between Complexity Theory, Professional Learning, and Lesson Study in Intermediate Mathematics Classrooms.” 2015. Web. 20 Sep 2020.

Vancouver:

Wilson DA. On the Relationship between Complexity Theory, Professional Learning, and Lesson Study in Intermediate Mathematics Classrooms. [Internet] [Doctoral dissertation]. University of Windsor; 2015. [cited 2020 Sep 20]. Available from: https://scholar.uwindsor.ca/etd/5497.

Council of Science Editors:

Wilson DA. On the Relationship between Complexity Theory, Professional Learning, and Lesson Study in Intermediate Mathematics Classrooms. [Doctoral Dissertation]. University of Windsor; 2015. Available from: https://scholar.uwindsor.ca/etd/5497

29. Russo, Vincent. Extended Nonlocal Games.

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/11620

► The notions of entanglement and nonlocality are among the most striking ingredients found in quantum information *theory*. One tool to better understand these notions is…
(more)

Subjects/Keywords: quantum information; quantum complexity theory; nonlocal games

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Russo, V. (2017). Extended Nonlocal Games. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11620

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Russo, Vincent. “Extended Nonlocal Games.” 2017. Thesis, University of Waterloo. Accessed September 20, 2020. http://hdl.handle.net/10012/11620.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Russo, Vincent. “Extended Nonlocal Games.” 2017. Web. 20 Sep 2020.

Vancouver:

Russo V. Extended Nonlocal Games. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10012/11620.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Russo V. Extended Nonlocal Games. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11620

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

30.
Liu, Rui Peng.
Some Upper and Lower Bounds regarding Query * Complexity*.

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/12245

► Query *complexity* is one of the several notions of *complexity* de ned to measure the cost of algorithms. It plays an important role in demonstrating…
(more)

Subjects/Keywords: Quantum Complexity Theory; Graph Search Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liu, R. P. (2017). Some Upper and Lower Bounds regarding Query Complexity. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12245

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liu, Rui Peng. “Some Upper and Lower Bounds regarding Query Complexity.” 2017. Thesis, University of Waterloo. Accessed September 20, 2020. http://hdl.handle.net/10012/12245.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Rui Peng. “Some Upper and Lower Bounds regarding Query Complexity.” 2017. Web. 20 Sep 2020.

Vancouver:

Liu RP. Some Upper and Lower Bounds regarding Query Complexity. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10012/12245.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu RP. Some Upper and Lower Bounds regarding Query Complexity. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12245

Not specified: Masters Thesis or Doctoral Dissertation