◍wovepaper
SearchResearchersInstitutions
Sign in
cs.CCApr 1, 2007
authors
  • Sergey Gubin
arXiv abstractPDF
paper

Reducing SAT to 2-SAT

arXiv:0704.0108

Abstract

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

8 pages

References in corpus (3)

  • A Polynomial Time Algorithm for The Traveling Salesman Problem
  • Polynomial time algorithm for 3-SAT. Examples of use
  • A Polynomial Time Algorithm for 3-SAT
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.