Browsing Computation by Subject "Factoring"

Now showing items 1-2 of 2

    • Minimização ótima de classes especiais de funções booleanas 

      Callegaro, Vinicius (2016) [Thesis]
      The problem of factoring and decomposing Boolean functions is Σ-complete𝑃2 for general functions. Efficient and exact algorithms can be created for an existing class of functions known as read-once, disjoint-support ...

    • Read-polarity-once functions 

      Callegaro, Vinicius (2012) [Dissertation]
      Efficient exact factoring algorithms are limited to read-once functions, in which each variable appears once in the final Boolean equation. However, those algorithms present two main constraints: (1) they do not consider ...