Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Polynomial Time Algorithm for 3-SAT

Published 4 Jan 2007 in cs.CC, cs.DM, cs.DS, and cs.LO | (0701023v4)

Abstract: Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up