Data Structures and Algorithms

    

An Idea For Solving 3SAT

Authors: Delavar Qasemi

In this paper, we present an algorithm that can be used to convert phi into a solvable form. This is done using binary combinations and the relations between them. Binary combinations are all 2-Clauses that can be obtained from n literal of phi and with their help we convert phi into a readable form phi_2 . phi_1 and phi_2 are equivalent (phi_1 is the same as orginal phi), so we can solve phi_2 instead of solving phi_1 .The algorithm performs the transform operation in 4 steps , and in each step it converts phi_i to phi_i+1. phi_i s and phi are equivalent. It can be proven that in the worst case phi_5 is solvable. The time and space order of this algorithm is O(n^96) .

Comments: 7 Pages.

Download: PDF

Submission history

[v1] 2025-08-10 05:23:49

Unique-IP document downloads: 211 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus