The Karp Dataset

Mason DiCicco, Eamon Worden, Daniel Reichman, Neil Heffernan, Conner Olsen, Nikhil Gangaram

Keywords: Dataset, Reduction, Large Language Model

TL;DR: We introduce a dataset of natural language NP-hardness reductions

Abstract: Understanding the mathematical reasoning capabilities of Large Language Models (LLMs) is a central topic in the study of artificial intelligence. This new domain necessitates the creation of datasets of reasoning tasks for both training and benchmarking the performance of LLMs. To this end, we introduce the Karp dataset: The first dataset composed of detailed proofs of NP-completeness reductions. The reductions vary in difficulty, ranging from simple exercises of undergraduate courses to more challenging reductions from academic papers. We compare the performance of state-of-the-art models on this task and demonstrate the effect of fine-tuning with the Karp dataset on reasoning capacity.

Concurrent Submissions: N/A

Submission Number: 57