Balanced incomplete block designs and exact satisfiability

10/05/2020
by   Bernd. R. Schuh, et al.
0

The paper explores the correspondence between balanced incomplete block designs (BIBD) and certain linear CNF formulas by identifying the points of a block design with the clauses of the Boolean formula and blocks with Boolean variables. Parallel classes in BIBDs correspond to XSAT solutions in the corresponding formula. This correspondence allows for transfers of results from one field to the other. As a new result we deduce from known satisfiability theorems that the problem of finding a parallel class in a partially balanced incomplete block design is NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2021

Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and its Implications on P versus NP problem

In this paper, a necessary and sufficient condition for satisfiability o...
research
05/31/2018

Near-Balanced Incomplete Block Designs with An Application to Poster Competitions

Judging scholarly posters creates a challenge to assign the judges effic...
research
09/28/2011

Fault Tolerant Boolean Satisfiability

A delta-model is a satisfying assignment of a Boolean formula for which ...
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...
research
02/28/2022

On the complexity of finding well-balanced orientations with upper bounds on the out-degrees

We show that the problem of deciding whether a given graph G has a well-...
research
03/16/2023

A bit-parallel tabu search algorithm for finding E(s^2)-optimal and minimax-optimal supersaturated designs

We prove the equivalence of two-symbol supersaturated designs (SSDs) wit...
research
03/24/2021

Anova of Balanced Variance Component Models

Balanced linear models with fixed effects are taught in undergraduate pr...

Please sign up or login with your details

Forgot password? Click here to reset