Progetto “Monnezza”
Alcune chiarificazioni sul progetto di Algoritmi e Strutture Dati denominato “Monnezza”. Se si abbandonano rifiuti in una discarica, eccedendo la sua capacità, l’eccedenza deve essere posta a destra della discarica, … Continue reading
Italian keyboards and Emacs
When typing on an Italian keyboard, composing LaTeX documents, it is always a pain since a couple of fundamental characters are lacking: tilde and backtick. There are useless characters like … Continue reading
Monomorphisms as limits
Sometimes it is useful to think to monomorphisms as limits of a category. Let be a monomorhism, i.e., for every pair of arrows , if , then . This is … Continue reading
Old website
As announced, I dismissed my old website. Its URL is still valid, and it redirects here.
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
