SAT problem and statistical distance
نویسنده
چکیده
In this paper with two equivalent representations of the information contained by a SAT formula, the reason why string generated by succinct SAT formula can be greatly compressed is firstly presented based on Kolmogorov complexity theory. Then what strings can be greatly compressed were classified and discussed. In this way we discovered the SAT problem was composed of a basic problem: distinguish between two different distributions induced under the computer. We then tried to map this problem into quantum mechanics, or the quantum version of the basic problem: this time two different distributions are induced under quantum mechanics. Based on the equivalence of statistical distance between probability space and Hilbert space, in the same time this distance is invariant under all unitary transformations. The basic problem's quantum version cannot be efficiently solved by any quantum computer. In the worst case, any quantum computer must perform exponential times measurement in order to solve it. In the end we proposed the main theorem : The statistical distance in SAT formula space and probability space are identical. We tried to prove it using the relationship of Kolmogorov complexity and entropy. It showed there is no difference to solve the basic problem in SAT formula space or probability space. In the worst case, exponential trials must be performed to solve it. NP!=P.
منابع مشابه
Pairs of SAT Assignments and Clustering in Random Boolean Formulæ
We investigate geometrical properties of the random K-satisfiability problem. For large enough K, we prove that there exists a region of clause density, below the satisfiability threshold, where SAT assignments are grouped into well separated clusters. This confirms the validity of the clustering scenario which is at the heart of the recent heuristic analysis of satisfiability using statistical...
متن کاملPairs of SAT Assignment in Random Boolean Formulæ
We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable is there exist two SAT assignments differing in Nx variables. We show the existence of a sharp threshold for this property as a function of the clause density. For large enough K, we prove that there exists a region of clause density, below the satisfiabi...
متن کاملDISTANCE-SAT: Complexity and Algorithms
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositional framework. The decision problem DISTANCE-SAT that consists in determining whether a propositional CNF formula admits a model that disagrees with a given partial interpretation on at most d variables, is introduced. ...
متن کاملOn the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems
In this paper we study the problem of estimating the time required to process decompositions of hard SAT instances encoding inversion problems of some cryptographic functions. In particular, we consider one type of SAT decompositions, usually referred to as SAT partitioning. The effectiveness of a specific SAT parititioning is the total time required to solve all SAT instances from this partiti...
متن کاملMaxwell-Boltzmann and Bose-Einstein Distributions for the SAT Problem
Recent studies in theoretical computer science have exploited new algorithms and methodologies based on statistical physics for investigating the structure and the properties of the Satisfiability problem. We propose a characterization of the SAT problem as a physical system, using both quantum and classical statistical-physical models. We associate a graph to a SAT instance and we prove that a...
متن کامل