Related papers: A Reply to "On Salum's Algorithm for X3SAT"

This paper summarizes my doctoral research on evaluation algorithms for HEX-programs, which extend Answer Set Programming with means for interfacing external computations. The focus is on integrating different subprocesses of…

This is a position paper written as an introduction to the special volume on quantum algorithms I edited for the journal Mathematical Structures in Computer Science (Volume 20 - Special Issue 06 (Quantum Algorithms), 2010).

We present an extremely simple polynomial-space exponential-time $(1-\varepsilon)$-approximation algorithm for MAX-k-SAT that is (slightly) faster than the previous known polynomial-space $(1-\varepsilon)$-approximation algorithms by Hirsch…

When solving propositional logic satisfiability (specifically 3SAT) using quantum annealing, we analyze the effect the difficulty of different instances of the problem has on the quality of the answer returned by the quantum annealer. A…

The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for over 4 decades. It has been clear that if an algorithm existed that would solve the problems in the NP class in…

Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality…

We present various analytic and number theoretic results concerning the #SAT problem as reflected when reduced into a #PART problem. As an application we propose a heuristic to probabilistically estimate the solution of #SAT problems.

In this paper, we propose an algorithm for the positive one-in-three satisfiability problem (Pos1in3SAT). The proposed algorithm can efficiently decide the existence of a satisfying assignment in all assignments for a given formula by using…

In this paper we present the algorithm of finding the solutions of the equation $x^3+ax=b$ in $\mathbb{Z}^*_3$ with coefficients from $\mathbb{Q}_3$.

MaxSAT, the optimization version of the well-known SAT problem, has attracted a lot of research interest in the last decade. Motivated by the many important applications and inspired by the success of modern SAT solvers, researchers have…

Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually,…

This technical report aims to complement the conference paper (https://doi.org/10.1145/3678717.3691325) by providing additional experiments or further details that could not be included in the paper.

Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…

Brief response to a Reply [arXiv:1005.2615] on our Comments [arXiv:1005.0838] on XENON100 recent results [arXiv:1005.0380].

This is a supplement to the article "Markov Chain Monte Carlo Based on Deterministic Transformations" available at http://arxiv.org/abs/1106.5850

This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum…

There are errors in the algorithm proposed by Narendra Chaudhari [2] purporting to solve the 3-sat problem in polynomial time. The present paper present instances for which the algorithm outputs erroneous results.

This is a reply to the paper by S.C.Benjamin, quant-ph/0008127.

In this paper, some points to the convergence analysis performed in the paper [A new computing approach for power signal modeling using fractional adaptive algorithms, ISA Transactions 68 (2017) 189-202] are presented. It is highlighted…

This work solves 3SAT, a classical NP-complete problem, on a CMOS-based Ising hardware chip with all-to-all connectivity. The paper addresses practical issues in going from algorithms to hardware. It considers several degrees of freedom in…