Victoria Horan

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

2015 · arXiv (Cornell University)

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a …