ARTÍCULO
TITULO

Characterizing the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs

Brosenne    
H. Homeister    
M. Waack    
S.    

Resumen

No disponible

 Artículos similares

       
 
Francesca Vatta, Alessandro Soranzo, Massimiliano Comisso, Giulia Buttazzoni and Fulvio Babich    
Low Density Parity Check (LDPC) codes are currently being deeply analyzed through algorithms that require the capability of addressing their iterative decoding convergence performance. Since it has been observed that the probability distribution function... ver más
Revista: Information

 
Francisca Aguilera, Felipe Ossio     Pág. 527 - 536
AbstractThe national and international overview has shown that residential energy consumption is increasing. As a result, efforts have focused on reducing the initial demand for housing and its associated consumption. One of the most used tools for this ... ver más

 
Morgane Derrien, Yun Kyung Lee, Jin Hur     Pág. 1 - 16
Despite the environmental significance of dissolved organic matter (DOM), characterizing DOM is still challenging due to its structural complexity and heterogeneity. In this study, three different chemical fractions, including hydrophobic acid (HPOA), tr... ver más
Revista: Water

 
Belete Berhanu, Yilma Seleshi, Solomon S. Demisse and Assefa M. Melesse    
The spatiotemporal variability of a stream flow due to the complex interaction of catchment attributes and rainfall induce complexity in hydrology. Researchers have been trying to address this complexity with a number of approaches; river flow regime is ... ver más
Revista: Water