Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(extension complexity). Showing records 1 – 7 of 7 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universiteit Utrecht

1. Hu, H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.

Degree: 2015, Universiteit Utrecht

 In linear programming one can formulate many combinatorial optimization problems as optimizing a linear function over a feasible region that is a polytope. A polytope… (more)

Subjects/Keywords: linear programming; extension complexity; communication theory; stable set polytope; graph operations; perfect graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, H. (2015). On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/316002

Chicago Manual of Style (16th Edition):

Hu, H. “On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.” 2015. Masters Thesis, Universiteit Utrecht. Accessed December 09, 2019. http://dspace.library.uu.nl:8080/handle/1874/316002.

MLA Handbook (7th Edition):

Hu, H. “On the Extension Complexity of Stable Set Polytopes for Perfect Graphs.” 2015. Web. 09 Dec 2019.

Vancouver:

Hu H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Dec 09]. Available from: http://dspace.library.uu.nl:8080/handle/1874/316002.

Council of Science Editors:

Hu H. On the Extension Complexity of Stable Set Polytopes for Perfect Graphs. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/316002


University of Windsor

2. Duan, Xiaolin. Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field.

Degree: MA, Electrical and Computer Engineering, 2018, University of Windsor

 Bit-parallel multiplication in GF(2^n) with subquadratic space complexity has been explored in recent years due to its lower area cost compared with traditional parallel multiplications.… (more)

Subjects/Keywords: Binary extension field; Finite field multiplier; Karatsuba algorithm; Parallel multiplication; Subquadratic space complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duan, X. (2018). Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7516

Chicago Manual of Style (16th Edition):

Duan, Xiaolin. “Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field.” 2018. Masters Thesis, University of Windsor. Accessed December 09, 2019. https://scholar.uwindsor.ca/etd/7516.

MLA Handbook (7th Edition):

Duan, Xiaolin. “Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field.” 2018. Web. 09 Dec 2019.

Vancouver:

Duan X. Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field. [Internet] [Masters thesis]. University of Windsor; 2018. [cited 2019 Dec 09]. Available from: https://scholar.uwindsor.ca/etd/7516.

Council of Science Editors:

Duan X. Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field. [Masters Thesis]. University of Windsor; 2018. Available from: https://scholar.uwindsor.ca/etd/7516


Louisiana State University

3. Kushwaha, Ambuj Kumar. Functional significance of unique sequences in Mycobaterium smegmatis Ku proteins.

Degree: PhD, 2013, Louisiana State University

 Ku is central to the non-homologous end-joining pathway of DNA double strand break repair, first discovered in eukaryotes and more recently in prokaryotes and archaea.… (more)

Subjects/Keywords: lysine-rich extension; histone-like proteins; Ku protein; DNA binding; electrophoretic mobility shift assay; low-complexity repeats; non-homologous end-joining; tryptophan fluorescence; thermal stability; zinc-binding; zinc toxicity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kushwaha, A. K. (2013). Functional significance of unique sequences in Mycobaterium smegmatis Ku proteins. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-10292013-141110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1359

Chicago Manual of Style (16th Edition):

Kushwaha, Ambuj Kumar. “Functional significance of unique sequences in Mycobaterium smegmatis Ku proteins.” 2013. Doctoral Dissertation, Louisiana State University. Accessed December 09, 2019. etd-10292013-141110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1359.

MLA Handbook (7th Edition):

Kushwaha, Ambuj Kumar. “Functional significance of unique sequences in Mycobaterium smegmatis Ku proteins.” 2013. Web. 09 Dec 2019.

Vancouver:

Kushwaha AK. Functional significance of unique sequences in Mycobaterium smegmatis Ku proteins. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2019 Dec 09]. Available from: etd-10292013-141110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1359.

Council of Science Editors:

Kushwaha AK. Functional significance of unique sequences in Mycobaterium smegmatis Ku proteins. [Doctoral Dissertation]. Louisiana State University; 2013. Available from: etd-10292013-141110 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1359


Texas A&M University

4. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

 In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,… (more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed December 09, 2019. http://hdl.handle.net/1969.1/155568.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 09 Dec 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1969.1/155568.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Jule, Alan. Etude des codes en graphes pour le stockage de données : Study of Sparse-Graph for Distributed Storage Systems.

Degree: Docteur es, STIC (sciences et technologies de l'information et de la communication) - Cergy, 2014, Cergy-Pontoise

Depuis deux décennies, la révolution technologique est avant tout numérique entrainant une forte croissance de la quantité de données à stocker. Le rythme de cette… (more)

Subjects/Keywords: Réseau de Stockage de données; Codes LDPC; Codes en graphe; Codes Sptiallement couplés; Complexité Mise à Jour; Extension du réseau; Sparse Graph Codes; Distributed Storage systems; LDPC codes; Spatially Coupled codes; Update Complexity; Load Rebalancing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jule, A. (2014). Etude des codes en graphes pour le stockage de données : Study of Sparse-Graph for Distributed Storage Systems. (Doctoral Dissertation). Cergy-Pontoise. Retrieved from http://www.theses.fr/2014CERG0739

Chicago Manual of Style (16th Edition):

Jule, Alan. “Etude des codes en graphes pour le stockage de données : Study of Sparse-Graph for Distributed Storage Systems.” 2014. Doctoral Dissertation, Cergy-Pontoise. Accessed December 09, 2019. http://www.theses.fr/2014CERG0739.

MLA Handbook (7th Edition):

Jule, Alan. “Etude des codes en graphes pour le stockage de données : Study of Sparse-Graph for Distributed Storage Systems.” 2014. Web. 09 Dec 2019.

Vancouver:

Jule A. Etude des codes en graphes pour le stockage de données : Study of Sparse-Graph for Distributed Storage Systems. [Internet] [Doctoral dissertation]. Cergy-Pontoise; 2014. [cited 2019 Dec 09]. Available from: http://www.theses.fr/2014CERG0739.

Council of Science Editors:

Jule A. Etude des codes en graphes pour le stockage de données : Study of Sparse-Graph for Distributed Storage Systems. [Doctoral Dissertation]. Cergy-Pontoise; 2014. Available from: http://www.theses.fr/2014CERG0739

6. Purin, Marju. Complexity over Finite-Dimensional Algebras.

Degree: PhD, Mathematics, 2011, Syracuse University

  In this thesis we study two types of complexity of modules over finite-dimensional algebras. In the first part, we examine the Ω-complexity of a… (more)

Subjects/Keywords: cluster tilted algebra; complexity; finite-dimensional algebra; tilting theory; trivial extension; Mathematics

…x5B;R]. Chapter 3 Complexity of Trivial Extension Algebras In this chapter we study… …over the trivial extension algebra T(Λ). 16 CHAPTER 3. COMPLEXITY OF TRIVIAL… …of complexity gives a way of measuring how ‘complicated’ a module is. We study two kinds of… …complexity. The first is Ω-complexity, where Ω denotes the syzygy operator, and it measures the… …type of complexity we call τ -complexity. Here τ is the Auslander-Reiten translate and τ… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Purin, M. (2011). Complexity over Finite-Dimensional Algebras. (Doctoral Dissertation). Syracuse University. Retrieved from https://surface.syr.edu/mat_etd/62

Chicago Manual of Style (16th Edition):

Purin, Marju. “Complexity over Finite-Dimensional Algebras.” 2011. Doctoral Dissertation, Syracuse University. Accessed December 09, 2019. https://surface.syr.edu/mat_etd/62.

MLA Handbook (7th Edition):

Purin, Marju. “Complexity over Finite-Dimensional Algebras.” 2011. Web. 09 Dec 2019.

Vancouver:

Purin M. Complexity over Finite-Dimensional Algebras. [Internet] [Doctoral dissertation]. Syracuse University; 2011. [cited 2019 Dec 09]. Available from: https://surface.syr.edu/mat_etd/62.

Council of Science Editors:

Purin M. Complexity over Finite-Dimensional Algebras. [Doctoral Dissertation]. Syracuse University; 2011. Available from: https://surface.syr.edu/mat_etd/62

7. Ennaoui, Karima. Computational aspects of infinite automata simulation and closure system related issues : Aspects de complexité du problème de composition des services web.

Degree: Docteur es, Informatique, 2017, Clermont Auvergne

La thèse est consacrée à des problématiques d’algorithmique et de complexité sur deux sujets. Le premier sujet s’intéresse à la composition comportementale des services web.… (more)

Subjects/Keywords: Service web; Comportement de service web; Composition de service web; Simulation des automates; Complexité; Exptime-complet; Théorie d’ordre; Système de fermeture; Treillis; Extension maximale; Bases de données; Base d’implications; Relation binaire; Clé candidate; Énumération; Délai polynomial; Délai incrémental; Web service; Web service behaviour; Web service composition; Automata simulation; Complexity; Product closure of automata; Asynchronous product; Exptime-complete; Order theory; Closure system; Lattice; Maximal extension; Database; Implicational base; Candidate key; Binary relation; Enumeration; Polynomial delay; Incremental delay

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ennaoui, K. (2017). Computational aspects of infinite automata simulation and closure system related issues : Aspects de complexité du problème de composition des services web. (Doctoral Dissertation). Clermont Auvergne. Retrieved from http://www.theses.fr/2017CLFAC031

Chicago Manual of Style (16th Edition):

Ennaoui, Karima. “Computational aspects of infinite automata simulation and closure system related issues : Aspects de complexité du problème de composition des services web.” 2017. Doctoral Dissertation, Clermont Auvergne. Accessed December 09, 2019. http://www.theses.fr/2017CLFAC031.

MLA Handbook (7th Edition):

Ennaoui, Karima. “Computational aspects of infinite automata simulation and closure system related issues : Aspects de complexité du problème de composition des services web.” 2017. Web. 09 Dec 2019.

Vancouver:

Ennaoui K. Computational aspects of infinite automata simulation and closure system related issues : Aspects de complexité du problème de composition des services web. [Internet] [Doctoral dissertation]. Clermont Auvergne; 2017. [cited 2019 Dec 09]. Available from: http://www.theses.fr/2017CLFAC031.

Council of Science Editors:

Ennaoui K. Computational aspects of infinite automata simulation and closure system related issues : Aspects de complexité du problème de composition des services web. [Doctoral Dissertation]. Clermont Auvergne; 2017. Available from: http://www.theses.fr/2017CLFAC031

.