CSAT is not in P

11/02/2021
by   Fabio Romano, et al.
0

In this paper we have to demonstrate that if we claim to have an algorithm that solves CSAT in polynomial time with a DTM (Deterministic Turing Machine), then we have to admit that: there is a counterexample that invalidates the correctness of the algorithm. This is because if we suppose that it can prove that an elenkhos formula (a formula that lists the negated codes of all models) is a contradiction, and if we change exactly a specific boolean variable of that formula, then we have proven that: in this case the algorithm will always fail.

READ FULL TEXT
04/06/2018

Complexity of the CNF-satisfiability problem

This paper is devoted to the complexity of the Boolean satisfiability pr...
07/18/2018

Quantified boolean formula problem

This paper is devoted to the complexity of the quantified boolean formul...
12/20/2019

Axiomatizing rectangular grids with no extra non-unary relations

We construct a formula ϕ which axiomatizes non-narrow rectangular grids ...
04/07/2021

On Salum's Algorithm for X3SAT

This is a commentary on, and critique of, Latif Salum's paper titled "Tr...
08/05/2021

The Key Equation for One-Point Codes

For Reed-Solomon codes, the key equation relates the syndrome polynomial...
09/29/2017

The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis

We aim at investigating the solvability/insolvability of nondeterministi...
02/22/2020

Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS

The concept of a uniform interpolant for a quantifier-free formula from ...