Solving 3-SAT and 3-dimensional matching in polynomial time
Abstract
We show how the implementation of conservative logic gates on flow networks suggests a way to solve 3SAT and 3-dimensional matching problems in polynomial time by using standard minimum-cost flow methods.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.