Advanced search options

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

You searched for `subject:(Computational Algebraic Geometry)`

.
Showing records 1 – 14 of
14 total matches.

▼ Search Limiters

University of Notre Dame

1. Timothy M McCoy. Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>.

Degree: PhD, Applied and Computational Mathematics and Statistics, 2014, University of Notre Dame

URL: https://curate.nd.edu/show/6395w66528z

► Algorithms from the field of numerical *algebraic* *geometry* provide robust means to compute all isolated solutions of arbitrary systems of polynomials and to give…
(more)

Subjects/Keywords: algebraic computation; numerical algebraic geometry; homotopy continuation; computational mathematics; polynomial systems; boundary value problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McCoy, T. M. (2014). Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/6395w66528z

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

McCoy, Timothy M. “Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>.” 2014. Doctoral Dissertation, University of Notre Dame. Accessed October 18, 2019. https://curate.nd.edu/show/6395w66528z.

MLA Handbook (7^{th} Edition):

McCoy, Timothy M. “Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>.” 2014. Web. 18 Oct 2019.

Vancouver:

McCoy TM. Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2014. [cited 2019 Oct 18]. Available from: https://curate.nd.edu/show/6395w66528z.

Council of Science Editors:

McCoy TM. Mesh-Expanding Homotopies and Numerical Irreducible Decomposition Over a Number Field</h1>. [Doctoral Dissertation]. University of Notre Dame; 2014. Available from: https://curate.nd.edu/show/6395w66528z

University of Minnesota

2. Razaviyayn, Meisam. Transceiver design and interference alignment in wireless networks: complexity and solvability.

Degree: MS, Mathematics, 2013, University of Minnesota

URL: http://hdl.handle.net/11299/162386

► This thesis aims to theoretically study a modern linear transceiver design strategy, namely interference alignment, in wireless networks. We consider an interference channel whereby each…
(more)

Subjects/Keywords: Algebraic geometry; Computational complexity; Interference alignment; Interference Channel

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Razaviyayn, M. (2013). Transceiver design and interference alignment in wireless networks: complexity and solvability. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/162386

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

Razaviyayn, Meisam. “Transceiver design and interference alignment in wireless networks: complexity and solvability.” 2013. Masters Thesis, University of Minnesota. Accessed October 18, 2019. http://hdl.handle.net/11299/162386.

MLA Handbook (7^{th} Edition):

Razaviyayn, Meisam. “Transceiver design and interference alignment in wireless networks: complexity and solvability.” 2013. Web. 18 Oct 2019.

Vancouver:

Razaviyayn M. Transceiver design and interference alignment in wireless networks: complexity and solvability. [Internet] [Masters thesis]. University of Minnesota; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11299/162386.

Council of Science Editors:

Razaviyayn M. Transceiver design and interference alignment in wireless networks: complexity and solvability. [Masters Thesis]. University of Minnesota; 2013. Available from: http://hdl.handle.net/11299/162386

University of Miami

3.
Masterjohn, Joseph.
Encasement: A Robust Method for Finding Intersections of Semi-*algebraic* Curves.

Degree: MS, Computer Science (Arts and Sciences), 2017, University of Miami

URL: https://scholarlyrepository.miami.edu/oa_theses/699

► One of the fundamental concepts in *computational* *geometry* is deducing the combinatorial structure, or interactions, of a group of static geometric objects. In two…
(more)

Subjects/Keywords: computational geometry; arrangements; algebraic curves; algorithms; intersections; polynomial systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Masterjohn, J. (2017). Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. (Thesis). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_theses/699

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

Masterjohn, Joseph. “Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.” 2017. Thesis, University of Miami. Accessed October 18, 2019. https://scholarlyrepository.miami.edu/oa_theses/699.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Masterjohn, Joseph. “Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.” 2017. Web. 18 Oct 2019.

Vancouver:

Masterjohn J. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. [Internet] [Thesis]. University of Miami; 2017. [cited 2019 Oct 18]. Available from: https://scholarlyrepository.miami.edu/oa_theses/699.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Masterjohn J. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. [Thesis]. University of Miami; 2017. Available from: https://scholarlyrepository.miami.edu/oa_theses/699

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

4. Vonk, Jan Bert. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications.

Degree: PhD, 2015, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130

► We investigate the action of the Atkin operator on spaces of overconvergent p-adic modular forms. Our contributions are both *computational* and geometric. We present several…
(more)

Subjects/Keywords: 515; Algebraic geometry; Number theory; Modular forms; Hecke operators; p-adic geometry; computational number theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vonk, J. B. (2015). The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130

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

Vonk, Jan Bert. “The Atkin operator on spaces of overconvergent modular forms and arithmetic applications.” 2015. Doctoral Dissertation, University of Oxford. Accessed October 18, 2019. http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130.

MLA Handbook (7^{th} Edition):

Vonk, Jan Bert. “The Atkin operator on spaces of overconvergent modular forms and arithmetic applications.” 2015. Web. 18 Oct 2019.

Vancouver:

Vonk JB. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2019 Oct 18]. Available from: http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130.

Council of Science Editors:

Vonk JB. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. [Doctoral Dissertation]. University of Oxford; 2015. Available from: http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130

Indian Institute of Science

5. Sen, Aritra. Module Grobner Bases Over Fields With Valuation.

Degree: 2015, Indian Institute of Science

URL: http://etd.iisc.ernet.in/handle/2005/2644 ; http://etd.ncsi.iisc.ernet.in/abstracts/3448/G26717-Abs.pdf

► Tropical *geometry* is an area of mathematics that interfaces *algebraic* *geometry* and combinatorics. The main object of study in tropical *geometry* is the tropical variety,…
(more)

Subjects/Keywords: Grobner Basis; Tropical Algebraic Geometry; Grobner Basis Theory; Hilbert Polynomials; Syzygies; Free Resolutions; Computational Geometry; Grobner Basis Computation; Algebraic Geometry; Tropical Geometry; Grobner Bases; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sen, A. (2015). Module Grobner Bases Over Fields With Valuation. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2644 ; http://etd.ncsi.iisc.ernet.in/abstracts/3448/G26717-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Sen, Aritra. “Module Grobner Bases Over Fields With Valuation.” 2015. Thesis, Indian Institute of Science. Accessed October 18, 2019. http://etd.iisc.ernet.in/handle/2005/2644 ; http://etd.ncsi.iisc.ernet.in/abstracts/3448/G26717-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sen, Aritra. “Module Grobner Bases Over Fields With Valuation.” 2015. Web. 18 Oct 2019.

Vancouver:

Sen A. Module Grobner Bases Over Fields With Valuation. [Internet] [Thesis]. Indian Institute of Science; 2015. [cited 2019 Oct 18]. Available from: http://etd.iisc.ernet.in/handle/2005/2644 ; http://etd.ncsi.iisc.ernet.in/abstracts/3448/G26717-Abs.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sen A. Module Grobner Bases Over Fields With Valuation. [Thesis]. Indian Institute of Science; 2015. Available from: http://etd.iisc.ernet.in/handle/2005/2644 ; http://etd.ncsi.iisc.ernet.in/abstracts/3448/G26717-Abs.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

6. Sen, Aritra. Module Grobner Bases Over Fields With Valuation.

Degree: 2015, Indian Institute of Science

URL: http://hdl.handle.net/2005/2644

► Tropical *geometry* is an area of mathematics that interfaces *algebraic* *geometry* and combinatorics. The main object of study in tropical *geometry* is the tropical variety,…
(more)

Subjects/Keywords: Grobner Basis; Tropical Algebraic Geometry; Grobner Basis Theory; Hilbert Polynomials; Syzygies; Free Resolutions; Computational Geometry; Grobner Basis Computation; Algebraic Geometry; Tropical Geometry; Grobner Bases; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sen, A. (2015). Module Grobner Bases Over Fields With Valuation. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2644

Not specified: Masters Thesis or Doctoral Dissertation

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

Sen, Aritra. “Module Grobner Bases Over Fields With Valuation.” 2015. Thesis, Indian Institute of Science. Accessed October 18, 2019. http://hdl.handle.net/2005/2644.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sen, Aritra. “Module Grobner Bases Over Fields With Valuation.” 2015. Web. 18 Oct 2019.

Vancouver:

Sen A. Module Grobner Bases Over Fields With Valuation. [Internet] [Thesis]. Indian Institute of Science; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2005/2644.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sen A. Module Grobner Bases Over Fields With Valuation. [Thesis]. Indian Institute of Science; 2015. Available from: http://hdl.handle.net/2005/2644

Not specified: Masters Thesis or Doctoral Dissertation

7. Helmer, Martin. Algorithms to Compute Characteristic Classes.

Degree: 2015, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/2923

► In this thesis we develop several new algorithms to compute characteristics classes in a variety of settings. In addition to algorithms for the computation of…
(more)

Subjects/Keywords: Euler characteristic; Chern-Schwartz-MacPherson class; Characteristic class; Computer algebra; Computational intersection theory; Algebraic geometry; Algebra; Algebraic Geometry; Geometry and Topology; Other Applied Mathematics; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Helmer, M. (2015). Algorithms to Compute Characteristic Classes. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/2923

Not specified: Masters Thesis or Doctoral Dissertation

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

Helmer, Martin. “Algorithms to Compute Characteristic Classes.” 2015. Thesis, University of Western Ontario. Accessed October 18, 2019. https://ir.lib.uwo.ca/etd/2923.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Helmer, Martin. “Algorithms to Compute Characteristic Classes.” 2015. Web. 18 Oct 2019.

Vancouver:

Helmer M. Algorithms to Compute Characteristic Classes. [Internet] [Thesis]. University of Western Ontario; 2015. [cited 2019 Oct 18]. Available from: https://ir.lib.uwo.ca/etd/2923.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Helmer M. Algorithms to Compute Characteristic Classes. [Thesis]. University of Western Ontario; 2015. Available from: https://ir.lib.uwo.ca/etd/2923

Not specified: Masters Thesis or Doctoral Dissertation

8. Mayster, Yan B. Minimax and Maximin Fitting of Geometric Objects to Sets of Points.

Degree: PhD, Computer Science, 2011, U of Denver

URL: https://digitalcommons.du.edu/etd/412

► This thesis addresses several problems in the facility location sub-area of *computational* *geometry*. Let S be a set of n points in the plane.…
(more)

Subjects/Keywords: Approximation algorithms; Computational geometry; Facility location; Pattern recognition; Routing; Algebraic Geometry; Computer Sciences; Mathematics; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mayster, Y. B. (2011). Minimax and Maximin Fitting of Geometric Objects to Sets of Points. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/412

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

Mayster, Yan B. “Minimax and Maximin Fitting of Geometric Objects to Sets of Points.” 2011. Doctoral Dissertation, U of Denver. Accessed October 18, 2019. https://digitalcommons.du.edu/etd/412.

MLA Handbook (7^{th} Edition):

Mayster, Yan B. “Minimax and Maximin Fitting of Geometric Objects to Sets of Points.” 2011. Web. 18 Oct 2019.

Vancouver:

Mayster YB. Minimax and Maximin Fitting of Geometric Objects to Sets of Points. [Internet] [Doctoral dissertation]. U of Denver; 2011. [cited 2019 Oct 18]. Available from: https://digitalcommons.du.edu/etd/412.

Council of Science Editors:

Mayster YB. Minimax and Maximin Fitting of Geometric Objects to Sets of Points. [Doctoral Dissertation]. U of Denver; 2011. Available from: https://digitalcommons.du.edu/etd/412

9. Hein, Nickolas Jason. Reality and Computation in Schubert Calculus.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151084

► The Mukhin-Tarasov-Varchenko Theorem (previously the Shapiro Conjecture) asserts that a Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a…
(more)

Subjects/Keywords: Schubert Calculus; Square Systems; Certification; Real Algebraic Geometry; Computational Algebraic Geometry; Enumerative Algebraic Geometry

…curves,
thereby generalizing the fundamental theorem of algebra. Enumerative *algebraic* *geometry*… …meaning. The most elegant results in enumerative *algebraic* *geometry*, such as the fundamental… …counting
complex roots is typical of statements in enumerative real *algebraic* *geometry*. This… …enumerative theory of real *algebraic* *geometry* is not as well formed as its complex
companion.
With… …the use of computers we may now engage in a study of enumerative real *algebraic* *geometry*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hein, N. J. (2013). Reality and Computation in Schubert Calculus. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151084

Not specified: Masters Thesis or Doctoral Dissertation

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

Hein, Nickolas Jason. “Reality and Computation in Schubert Calculus.” 2013. Thesis, Texas A&M University. Accessed October 18, 2019. http://hdl.handle.net/1969.1/151084.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hein, Nickolas Jason. “Reality and Computation in Schubert Calculus.” 2013. Web. 18 Oct 2019.

Vancouver:

Hein NJ. Reality and Computation in Schubert Calculus. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1969.1/151084.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hein NJ. Reality and Computation in Schubert Calculus. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151084

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

10.
Sinnott, Steven.
Results in *Computational* Algebra of Bayesian Networks
.

Degree: 2006, Cornell University

URL: http://hdl.handle.net/1813/3364

► This dissertation studies the *algebraic* varieties arising from the conditional independence statements of Bayesian networks. Reduction techniques are described for relating these varieties to the…
(more)

Subjects/Keywords: computational algebra; bayesian networks; algebraic geometry; determinantal ideals

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sinnott, S. (2006). Results in Computational Algebra of Bayesian Networks . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/3364

Not specified: Masters Thesis or Doctoral Dissertation

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

Sinnott, Steven. “Results in Computational Algebra of Bayesian Networks .” 2006. Thesis, Cornell University. Accessed October 18, 2019. http://hdl.handle.net/1813/3364.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sinnott, Steven. “Results in Computational Algebra of Bayesian Networks .” 2006. Web. 18 Oct 2019.

Vancouver:

Sinnott S. Results in Computational Algebra of Bayesian Networks . [Internet] [Thesis]. Cornell University; 2006. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1813/3364.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sinnott S. Results in Computational Algebra of Bayesian Networks . [Thesis]. Cornell University; 2006. Available from: http://hdl.handle.net/1813/3364

Not specified: Masters Thesis or Doctoral Dissertation

11. Mayes, Sarah Courtney. The Asymptotic Behavior of Generic Initial Systems.

Degree: PhD, Mathematics, 2013, University of Michigan

URL: http://hdl.handle.net/2027.42/98028

► Consider a homogeneous ideal I contained inside of a polynomial ring over a field of characteristic zero with the reverse lexicographic order. The family of…
(more)

Subjects/Keywords: Computational Algebra; Algebraic Geometry; Mathematics; Science

…commutative algebra and *algebraic* *geometry* necessary for understanding the main results of the… …thesis. *Computational* commutative algebra is concerned with studying the *algebraic* structure of… …algebra and *geometry*; it is the subject of the field of *algebraic* *geometry*.
Our main asymptotic… …themes of this thesis: *algebraic* *geometry*,
generic initial ideals, and asymptotic behavior. The… …objects that form the basis of
*algebraic* *geometry* and commutative algebra. The most fundamental…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mayes, S. C. (2013). The Asymptotic Behavior of Generic Initial Systems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/98028

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

Mayes, Sarah Courtney. “The Asymptotic Behavior of Generic Initial Systems.” 2013. Doctoral Dissertation, University of Michigan. Accessed October 18, 2019. http://hdl.handle.net/2027.42/98028.

MLA Handbook (7^{th} Edition):

Mayes, Sarah Courtney. “The Asymptotic Behavior of Generic Initial Systems.” 2013. Web. 18 Oct 2019.

Vancouver:

Mayes SC. The Asymptotic Behavior of Generic Initial Systems. [Internet] [Doctoral dissertation]. University of Michigan; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2027.42/98028.

Council of Science Editors:

Mayes SC. The Asymptotic Behavior of Generic Initial Systems. [Doctoral Dissertation]. University of Michigan; 2013. Available from: http://hdl.handle.net/2027.42/98028

Virginia Tech

12.
Garcia-Puente, Luis David.
*Algebraic**Geometry* of Bayesian Networks.

Degree: PhD, Mathematics, 2004, Virginia Tech

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

► We develop the necessary theory in *algebraic* *geometry* to place Bayesian networks into the realm of *algebraic* statistics. This allows us to create an *algebraic*…
(more)

Subjects/Keywords: statistical modelling; algebraic geometry; bayesian networks; computational commutative algebra; statistics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garcia-Puente, L. D. (2004). Algebraic Geometry of Bayesian Networks. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/11133

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

Garcia-Puente, Luis David. “Algebraic Geometry of Bayesian Networks.” 2004. Doctoral Dissertation, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/11133.

MLA Handbook (7^{th} Edition):

Garcia-Puente, Luis David. “Algebraic Geometry of Bayesian Networks.” 2004. Web. 18 Oct 2019.

Vancouver:

Garcia-Puente LD. Algebraic Geometry of Bayesian Networks. [Internet] [Doctoral dissertation]. Virginia Tech; 2004. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/11133.

Council of Science Editors:

Garcia-Puente LD. Algebraic Geometry of Bayesian Networks. [Doctoral Dissertation]. Virginia Tech; 2004. Available from: http://hdl.handle.net/10919/11133

13.
Gandhi, Ratnik.
* Algebraic* approach to Nash equilibria for finite normal
form games;.

Degree: 2005, INFLIBNET

URL: http://shodhganga.inflibnet.ac.in/handle/10603/54860

Abstract Available newline

Subjects/Keywords: Game theory; Galois theory; Economics, Mathematical; Model theory; Equilibrium (Economics); Nash equilibrium; Computational complexity; Algebraic geometry; Number of equilibria

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gandhi, R. (2005). Algebraic approach to Nash equilibria for finite normal form games;. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/54860

Not specified: Masters Thesis or Doctoral Dissertation

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

Gandhi, Ratnik. “Algebraic approach to Nash equilibria for finite normal form games;.” 2005. Thesis, INFLIBNET. Accessed October 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/54860.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gandhi, Ratnik. “Algebraic approach to Nash equilibria for finite normal form games;.” 2005. Web. 18 Oct 2019.

Vancouver:

Gandhi R. Algebraic approach to Nash equilibria for finite normal form games;. [Internet] [Thesis]. INFLIBNET; 2005. [cited 2019 Oct 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/54860.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gandhi R. Algebraic approach to Nash equilibria for finite normal form games;. [Thesis]. INFLIBNET; 2005. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/54860

Not specified: Masters Thesis or Doctoral Dissertation

University of Lund

14. Gudmundsson, Joachim. Geometric Decompositions and Networks - Approximation Bounds and Algorithms.

Degree: 2000, University of Lund

URL: http://lup.lub.lu.se/record/19742 ; http://portal.research.lu.se/ws/files/4540703/1001965.pdf

► In this thesis we focus on four problems in *computational* *geometry*: In the first four chapters we consider the problem of covering an arbitrary polygon…
(more)

Subjects/Keywords: Datavetenskap (datalogi); computer technology; Systems engineering; kontroll; system; Delaunay triangulation; Computational geometry; TSP with neighborhoods; geometric spanners; covering polygons; Computer science; numerical analysis; systems; control; numerisk analys; Datalogi; algebraisk topologi; algebraic topology; Geometry; Data- och systemvetenskap; Geometri

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gudmundsson, J. (2000). Geometric Decompositions and Networks - Approximation Bounds and Algorithms. (Doctoral Dissertation). University of Lund. Retrieved from http://lup.lub.lu.se/record/19742 ; http://portal.research.lu.se/ws/files/4540703/1001965.pdf

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

Gudmundsson, Joachim. “Geometric Decompositions and Networks - Approximation Bounds and Algorithms.” 2000. Doctoral Dissertation, University of Lund. Accessed October 18, 2019. http://lup.lub.lu.se/record/19742 ; http://portal.research.lu.se/ws/files/4540703/1001965.pdf.

MLA Handbook (7^{th} Edition):

Gudmundsson, Joachim. “Geometric Decompositions and Networks - Approximation Bounds and Algorithms.” 2000. Web. 18 Oct 2019.

Vancouver:

Gudmundsson J. Geometric Decompositions and Networks - Approximation Bounds and Algorithms. [Internet] [Doctoral dissertation]. University of Lund; 2000. [cited 2019 Oct 18]. Available from: http://lup.lub.lu.se/record/19742 ; http://portal.research.lu.se/ws/files/4540703/1001965.pdf.

Council of Science Editors:

Gudmundsson J. Geometric Decompositions and Networks - Approximation Bounds and Algorithms. [Doctoral Dissertation]. University of Lund; 2000. Available from: http://lup.lub.lu.se/record/19742 ; http://portal.research.lu.se/ws/files/4540703/1001965.pdf