Mathematics, Department of
Date of this Version
Spring 3-14-2012
Abstract
Computational combinatorics involves combining pure mathematics, algorithms, and computational resources to solve problems in pure combinatorics. This thesis provides a theoretical framework for combinatorial search, which is then applied to several problems in combinatorics. Some results in space-bounded computational complexity are also presented.
Included in
Discrete Mathematics and Combinatorics Commons, Science and Mathematics Education Commons, Theory and Algorithms Commons
Comments
A DISSERTATION Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfilment of Requirements For the Degree of Doctor of Philosophy, Major: Mathematics and Computer Science, Under the Supervision of Professor Stephen G. Hartke and Professor N. V. Vinodchandran. Lincoln, Nebraska: May, 2012
Copyright (c) 2012 Derrick Stolee