AI Chat AI Image Generator AI Video Text to Speech

Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem

08/28/2017

∙

by Shunichi Matsubara, et al.

∙

∙

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 a 2-dimensional binary search method without constructing an exponential number of assignments.

research

∙ 03/25/2019

Faster Random k-CNF Satisfiability

We describe an algorithm to solve the problem of Boolean CNF-Satisfiabil...

0 Andrea Lincoln, et al. ∙

research

∙ 03/29/2023

Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem

For typical first-order logical theories, satisfying assignments have a ...

0 Enrico Lipparini, et al. ∙

research

∙ 02/10/2023

The Role of Codeword-to-Class Assignments in Error-Correcting Codes: An Empirical Study

Error-correcting codes (ECC) are used to reduce multiclass classificatio...

0 Itay Evron, et al. ∙

research

∙ 10/08/2020

An Improved Exact Algorithm for the Exact Satisfiability Problem

The Exact Satisfiability problem, XSAT, is defined as the problem of fin...

0 Gordon Hoi, et al. ∙

research

∙ 10/29/2019

Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms

Given a Boolean formula ϕ(x) in conjunctive normal form (CNF), the densi...

0 Tuhin Sahai, et al. ∙

research

∙ 01/21/2021

Improved Algorithms for the General Exact Satisfiability Problem

The Exact Satisfiability problem asks if we can find a satisfying assign...

0 Gordon Hoi, et al. ∙

research

∙ 11/03/2020

The Long, the Short and the Random

We furnish solid evidence, both theoretical and empirical, towards the e...

0 Giorgio Camerani, et al. ∙