Francesco Cristiano

Learn More
We investigate the complexity of the syntactic isomorphism problem of CNF Boolean Formulas (CSFI): given two CNF Boolean formulas ϕ(a 1 ,. .. , a n) and ϕ(b 1 ,. .. , b n) decide whether there exists a permutation of clauses, a permutation of literals and a bijection between their variables such that ϕ(a 1 ,. .. , a n) and ϕ(b 1 ,. .. , b n) become(More)
  • 1