Advanced search options

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

Dept: Computer Science ^{❌}

You searched for `subject:(Complexity theory)`

.
Showing records 1 – 11 of
11 total matches.

▼ Search Limiters

Virginia Tech

1. Maji, Nabanita. An Interactive Tutorial for NP-Completeness.

Degree: MS, Computer Science, 2015, Virginia Tech

URL: http://hdl.handle.net/10919/52973

► A *Theory* of Algorithms course is essential to any Computer Science curriculum at both the undergraduate and graduate levels. It is also considered to be…
(more)

Subjects/Keywords: NP Completeness; Complexity Theory; Reductions; Algorithm Visualization; Computer Science Education; Automated Assessment

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maji, N. (2015). An Interactive Tutorial for NP-Completeness. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/52973

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

Maji, Nabanita. “An Interactive Tutorial for NP-Completeness.” 2015. Masters Thesis, Virginia Tech. Accessed October 15, 2019. http://hdl.handle.net/10919/52973.

MLA Handbook (7^{th} Edition):

Maji, Nabanita. “An Interactive Tutorial for NP-Completeness.” 2015. Web. 15 Oct 2019.

Vancouver:

Maji N. An Interactive Tutorial for NP-Completeness. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10919/52973.

Council of Science Editors:

Maji N. An Interactive Tutorial for NP-Completeness. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/52973

University of Illinois – Urbana-Champaign

2.
Gordon, Spencer L.
The *complexity* of continuous local search.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

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

► The *complexity* class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the *complexity* of some well-known problems in PPAD…
(more)

Subjects/Keywords: Theoretical computer science; Algorithmic game theory; Computational complexity; Linear complementarity problem; Contraction map

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gordon, S. L. (2017). The complexity of continuous local search. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97391

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):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed October 15, 2019. http://hdl.handle.net/2142/97391.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Web. 15 Oct 2019.

Vancouver:

Gordon SL. The complexity of continuous local search. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/2142/97391.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gordon SL. The complexity of continuous local search. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97391

Not specified: Masters Thesis or Doctoral Dissertation

Utah State University

3.
Mohamadlou, Hamid.
Algorithmic Information *Theory* Applications in Bright Field Microscopy and Epithelial Pattern Formation.

Degree: PhD, Computer Science, 2015, Utah State University

URL: https://digitalcommons.usu.edu/etd/4539

► Algorithmic Information *Theory* (AIT), also known as Kolmogorov *complexity*, is a quantitative approach to defining information. AIT is mainly used to measure the amount…
(more)

Subjects/Keywords: Algorithmic Information Theory; Kolmogorov complexity; Bright field cell; image segmentation; Gene Regulatory Network; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mohamadlou, H. (2015). Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation. (Doctoral Dissertation). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/4539

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

Mohamadlou, Hamid. “Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation.” 2015. Doctoral Dissertation, Utah State University. Accessed October 15, 2019. https://digitalcommons.usu.edu/etd/4539.

MLA Handbook (7^{th} Edition):

Mohamadlou, Hamid. “Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation.” 2015. Web. 15 Oct 2019.

Vancouver:

Mohamadlou H. Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation. [Internet] [Doctoral dissertation]. Utah State University; 2015. [cited 2019 Oct 15]. Available from: https://digitalcommons.usu.edu/etd/4539.

Council of Science Editors:

Mohamadlou H. Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation. [Doctoral Dissertation]. Utah State University; 2015. Available from: https://digitalcommons.usu.edu/etd/4539

Georgia Tech

4. Mehta, Nishant A. On sparse representations and new meta-learning paradigms for representation learning.

Degree: PhD, Computer Science, 2013, Georgia Tech

URL: http://hdl.handle.net/1853/52159

► Given the "right" representation, learning is easy. This thesis studies representation learning and meta-learning, with a special focus on sparse representations. Meta-learning is fundamental to…
(more)

Subjects/Keywords: Learning theory; Data-dependent complexity; Luckiness; Dictionary learning; Sparse coding; Lasso; Multi-task learning; Meta-learning; Learning to learn

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mehta, N. A. (2013). On sparse representations and new meta-learning paradigms for representation learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52159

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

Mehta, Nishant A. “On sparse representations and new meta-learning paradigms for representation learning.” 2013. Doctoral Dissertation, Georgia Tech. Accessed October 15, 2019. http://hdl.handle.net/1853/52159.

MLA Handbook (7^{th} Edition):

Mehta, Nishant A. “On sparse representations and new meta-learning paradigms for representation learning.” 2013. Web. 15 Oct 2019.

Vancouver:

Mehta NA. On sparse representations and new meta-learning paradigms for representation learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1853/52159.

Council of Science Editors:

Mehta NA. On sparse representations and new meta-learning paradigms for representation learning. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/52159

University of Manitoba

5. Page, Daniel. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines.

Degree: Computer Science, 2014, University of Manitoba

URL: http://hdl.handle.net/1993/23825

► Let there be m parallel machines and n jobs to be scheduled non-preemptively. A job j scheduled on machine i takes p_{i,j} time units to…
(more)

Subjects/Keywords: theoretical computer science; approximation algorithms; algorithms; combinatorial optimization; computational complexity theory; makespan problem; scheduling; unrelated parallel machines

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Page, D. (2014). Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/23825

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

Page, Daniel. “Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines.” 2014. Masters Thesis, University of Manitoba. Accessed October 15, 2019. http://hdl.handle.net/1993/23825.

MLA Handbook (7^{th} Edition):

Page, Daniel. “Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines.” 2014. Web. 15 Oct 2019.

Vancouver:

Page D. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines. [Internet] [Masters thesis]. University of Manitoba; 2014. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1993/23825.

Council of Science Editors:

Page D. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines. [Masters Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/23825

University of Iowa

6. Krohn, Erik Allyn. Surveilling roads and protecting art.

Degree: PhD, Computer Science, 2009, University of Iowa

URL: https://ir.uiowa.edu/etd/390

► Placing security cameras in buildings, finding good locations for cameras to enforce speed limits or placing guards to defend a border are some of…
(more)

Subjects/Keywords: algorithms; complexity; geometry; set cover; terrain; theory; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krohn, E. A. (2009). Surveilling roads and protecting art. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/390

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

Krohn, Erik Allyn. “Surveilling roads and protecting art.” 2009. Doctoral Dissertation, University of Iowa. Accessed October 15, 2019. https://ir.uiowa.edu/etd/390.

MLA Handbook (7^{th} Edition):

Krohn, Erik Allyn. “Surveilling roads and protecting art.” 2009. Web. 15 Oct 2019.

Vancouver:

Krohn EA. Surveilling roads and protecting art. [Internet] [Doctoral dissertation]. University of Iowa; 2009. [cited 2019 Oct 15]. Available from: https://ir.uiowa.edu/etd/390.

Council of Science Editors:

Krohn EA. Surveilling roads and protecting art. [Doctoral Dissertation]. University of Iowa; 2009. Available from: https://ir.uiowa.edu/etd/390

Purdue University

7.
Cao, Yudong.
Combinatorial algorithms for perturbation *theory* and application on quantum computing.

Degree: PhD, Computer Science, 2016, Purdue University

URL: https://docs.lib.purdue.edu/open_access_dissertations/908

► Quantum computing is an emerging area between computer science and physics. Numerous problems in quantum computing involve quantum many-body interactions. This dissertation concerns the…
(more)

Subjects/Keywords: Pure sciences; Applied sciences; Cellular automata; Computational complexity; Many-body interactions; Perturbation theory; Quantum mechanics; Symmetric polynomials; Computer Sciences; Quantum Physics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cao, Y. (2016). Combinatorial algorithms for perturbation theory and application on quantum computing. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/908

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

Cao, Yudong. “Combinatorial algorithms for perturbation theory and application on quantum computing.” 2016. Doctoral Dissertation, Purdue University. Accessed October 15, 2019. https://docs.lib.purdue.edu/open_access_dissertations/908.

MLA Handbook (7^{th} Edition):

Cao, Yudong. “Combinatorial algorithms for perturbation theory and application on quantum computing.” 2016. Web. 15 Oct 2019.

Vancouver:

Cao Y. Combinatorial algorithms for perturbation theory and application on quantum computing. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2019 Oct 15]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/908.

Council of Science Editors:

Cao Y. Combinatorial algorithms for perturbation theory and application on quantum computing. [Doctoral Dissertation]. Purdue University; 2016. Available from: https://docs.lib.purdue.edu/open_access_dissertations/908

8. Wilkens, Christopher A. Economics and Computation: Ad Auctions and Other Stories.

Degree: Computer Science, 2013, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/5r02h045

► There is a growing research tradition in the interface between Economics and Computer Science: Economic insights and questions about incentives inform the design of systems,…
(more)

Subjects/Keywords: Computer science; Economic theory; Ad Auctions; Auction Theory; Complexity Theory; Market Equilibrium

…mechanisms.
1.2
*Complexity* *Theory* and Markets
The study of markets often focuses on a… …x5B;78] recognized that *complexity*
*theory* offered rigorous tools to understand when an… …More generally, *complexity* *theory* offers rigorous techniques to understand what a computation… …and Hurwicz, Myerson’s
seminal study launched the engineering side of game *theory* now known… …*theory* because the strategy of a rational bidder
depends substantially on her beliefs about…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wilkens, C. A. (2013). Economics and Computation: Ad Auctions and Other Stories. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5r02h045

Not specified: Masters Thesis or Doctoral Dissertation

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

Wilkens, Christopher A. “Economics and Computation: Ad Auctions and Other Stories.” 2013. Thesis, University of California – Berkeley. Accessed October 15, 2019. http://www.escholarship.org/uc/item/5r02h045.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wilkens, Christopher A. “Economics and Computation: Ad Auctions and Other Stories.” 2013. Web. 15 Oct 2019.

Vancouver:

Wilkens CA. Economics and Computation: Ad Auctions and Other Stories. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Oct 15]. Available from: http://www.escholarship.org/uc/item/5r02h045.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wilkens CA. Economics and Computation: Ad Auctions and Other Stories. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/5r02h045

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

9. Loader, Lynn. Analysis of Algorithms Finding the Maximum Flow of a Planar Network.

Degree: Computer Science, 1983, University of Canterbury

URL: http://hdl.handle.net/10092/10174

► John H. Reif has recently developed an algorithm which finds the minimum cut of a planar network. This is a modification of an earlier algorithm…
(more)

Subjects/Keywords: Field of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Loader, L. (1983). Analysis of Algorithms Finding the Maximum Flow of a Planar Network. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/10174

Not specified: Masters Thesis or Doctoral Dissertation

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

Loader, Lynn. “Analysis of Algorithms Finding the Maximum Flow of a Planar Network.” 1983. Thesis, University of Canterbury. Accessed October 15, 2019. http://hdl.handle.net/10092/10174.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Loader, Lynn. “Analysis of Algorithms Finding the Maximum Flow of a Planar Network.” 1983. Web. 15 Oct 2019.

Vancouver:

Loader L. Analysis of Algorithms Finding the Maximum Flow of a Planar Network. [Internet] [Thesis]. University of Canterbury; 1983. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10092/10174.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Loader L. Analysis of Algorithms Finding the Maximum Flow of a Planar Network. [Thesis]. University of Canterbury; 1983. Available from: http://hdl.handle.net/10092/10174

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

10. Saunders, Shane. A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm.

Degree: Computer Science, 1999, University of Canterbury

URL: http://hdl.handle.net/10092/9484

► Dijkstra's algorithm computes the shortest paths between a starting vertex and each other vertex in a directed graph. The performance of Dijkstra's algorithm depends on…
(more)

Subjects/Keywords: Field of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Saunders, S. (1999). A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/9484

Not specified: Masters Thesis or Doctoral Dissertation

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

Saunders, Shane. “A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm.” 1999. Thesis, University of Canterbury. Accessed October 15, 2019. http://hdl.handle.net/10092/9484.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Saunders, Shane. “A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm.” 1999. Web. 15 Oct 2019.

Vancouver:

Saunders S. A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm. [Internet] [Thesis]. University of Canterbury; 1999. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10092/9484.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Saunders S. A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm. [Thesis]. University of Canterbury; 1999. Available from: http://hdl.handle.net/10092/9484

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

11. Oo, C. H. Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm.

Degree: Computer Science, 1978, University of Canterbury

URL: http://hdl.handle.net/10092/9483

► The Dantzig-Wolfe decomposition (linear programming) principle published in 1960 involves the solving of large-scale mathematical programming problems of particular structure. Large practical problems of this…
(more)

Subjects/Keywords: Field of Research::01 - Mathematical Sciences::0103 - Numerical and Computational Mathematics::010399 - Numerical and Computational Mathematics not elsewhere classified; Field of Research::01 - Mathematical Sciences::0102 - Applied Mathematics::010299 - Applied Mathematics not elsewhere classified; Field of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Oo, C. H. (1978). Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/9483

Not specified: Masters Thesis or Doctoral Dissertation

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

Oo, C H. “Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm.” 1978. Thesis, University of Canterbury. Accessed October 15, 2019. http://hdl.handle.net/10092/9483.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Oo, C H. “Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm.” 1978. Web. 15 Oct 2019.

Vancouver:

Oo CH. Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm. [Internet] [Thesis]. University of Canterbury; 1978. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10092/9483.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oo CH. Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm. [Thesis]. University of Canterbury; 1978. Available from: http://hdl.handle.net/10092/9483

Not specified: Masters Thesis or Doctoral Dissertation