Solving 3-SAT and 3-dimensional matching in polynomial time
Data Structures and Algorithms
2014-02-05 v6 Computational Complexity
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.
Keywords
Cite
@article{arxiv.1310.1971,
title = {Solving 3-SAT and 3-dimensional matching in polynomial time},
author = {Frederic Gillet},
journal= {arXiv preprint arXiv:1310.1971},
year = {2014}
}
Comments
The proposed method does not work. Updated the article with an analysis of why the general method suggested cannot work