# Reducing SAT to 2-SAT

## TL;DR

This paper presents a polynomial-time reduction from the SAT problem to the 2-SAT problem, demonstrating that SAT can be efficiently transformed into a simpler form.

## Contribution

It introduces a polynomial size reduction from SAT to 2-SAT, enabling easier solving of SAT instances.

## Key findings

- SAT can be reduced to 2-SAT in polynomial time
- The reduction maintains polynomial size
- Implications for solving SAT efficiently

## Abstract

Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.