A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

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 standard brute force approach on a typical computer. One sampl...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Horan, Victoria, Adachi, Steve, Bak, Stanley
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Mathematics - Combinatorics Physics - Quantum Physics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!