94 citations · 246 across the 28 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022★ 1 cited
Superredundancy: A tool for Boolean formula minimization complexity analysis
Paolo Liberatore
A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all mini…
cs.CC2004★ 1 cited
The Complexity of Modified Instances
Paolo Liberatore
In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is relevant whenever instances may change from time to time,…