◍wovepaper
SearchResearchersInstitutions
Sign in
cs.CCMar 21, 2007
2
citations (OpenAlex)
authors
  • Sergey Gubin
arXiv abstractPDF
paper

Polynomial time algorithm for 3-SAT. Examples of use

arXiv:cs/0703098

Abstract

The algorithm checks the propositional formulas for patterns of unsatisfiability.

19 pages

Cited by in corpus (2)

  • A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
  • Reducing SAT to 2-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.