The inverse satisfiability problem over a set of relations Γ (Inv-SAT (Γ)) is the problem of
deciding whether a relation R can be defined as the set of models of a SAT (Γ) instance …

The inverse satisfiability problem over a set of Boolean relations Gamma (Inv-SAT (Gamma))
is the computational decision problem of, given a set of models R, deciding whether there …

Obtaining lower bounds for NP-hard problems has for a long time been an active area of
research. Algebraic techniques introduced by Jonsson et al.(2017)[4] show that the fine …

Power density, performance, and chip's temperature are the competing factors in computer
architecture. Since 2009, when dark silicon marked the end of multicore scaling, hardware …

The inverse satisfiability problem over a set of Boolean relations Γ (Inv-SAT (Γ)) is the
computational decision problem of, given a relation R, deciding whether there exists a SAT …

Given an undirected graph G=(V, E) with n vertices, and a function f: V-> N, we consider the
problem of finding a connected f-factor in G. In this work we design an algorithm to check for …