Problems in computational algebra and integer programming

Simple item page
dc.contributor.authorBogart, Tristram, 1980-en_US
dc.date.accessioned2009-10-06T00:00:35Z
dc.date.available2009-10-06T00:00:35Z
dc.date.issued2007en_US
dc.descriptionThesis (Ph. D.)--University of Washington, 2007.en_US
dc.description.abstractThis thesis is a compendium of several projects that span the gap between commutative algebra and geometric combinatorics: one in tropical geometry, one in computational algebra, and two in discrete geometry and integer programming. Key tools used in this thesis include the theory of polyhedra, Grobner bases, and computational complexity theory.en_US
dc.format.extentvi, 137 p.en_US
dc.identifier.otherb58479715en_US
dc.identifier.other174270816en_US
dc.identifier.otherThesis 57035en_US
dc.identifier.urihttp://hdl.handle.net/1773/5805
dc.language.isoen_USen_US
dc.rightsCopyright is held by the individual authors.en_US
dc.rights.urien_US
dc.subject.otherTheses--Mathematicsen_US
dc.titleProblems in computational algebra and integer programmingen_US
dc.typeThesisen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
3265300.pdf
Size:
6.02 MB
Format:
Adobe Portable Document Format
Download

Collections

Mathematics