Now showing items 1-2 of 2

    • Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions 

      Karaşan, O. E. (Springer, 2011-08)
      We consider the problem of dualizing a Boolean function f represented by a DNF. In its most general form, this problem is commonly believed not to be solvable by a quasi-polynomial total time algorithm.We show that if the ...
    • On connected Boolean functions 

      Ekin, Oya; Hammer, P. L.; Kogan, A. (Elsevier, 1999)
      A Boolean function is called (co-)connected if the subgraph of the Boolean hypercube induced by its (false) true points is connected; it is called strongly connected if it is both connected and co-connected. The concept ...