1 paper · 1 filter
Ortho Flint, Asanka Wickramasinghe, Jason Brasse +1
In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficie…