Visiting JAIST
Currently, I’m in the Japanese Advanced Institute of Science and Technology, kindly hosted by Prof. H. Ishihara and Dr. T. Nemoto, as part of the CORCON research project. In this … Continue reading
A few notes on balanced trees
In the last project of the course “Algoritmi and Strutture Dati”, there was a problem requiring to find all the points containing some objects in a square of given width … Continue reading
An exact formula for satisfiability
Let be an instance of SAT. As in a previous post, let denote the i-th clause. Moreover, let . We know that . Evidently, is the set of assignments falsifying … Continue reading
A quick satisfiability check
As it is well-known, Boolean Satisfiability, SAT for short, is NP-complete. Suppose is a formula where is a literal, i.e., the variable , or , or (when the variable does … Continue reading
Marco Benini 