Reconstructing positive boolean functions with shadow clustering

Proceedings of the 2005 European Conference on Circuit Theory and Design

Volumn 3, Issue , 2005, Pages 377-380

  Muselli, Marco ^a   Quarati, Alfonso ^b  

^a CNR   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE RECONSTRUCTION; LOGIC DEVICES; NUMBER THEORY; PROBLEM SOLVING;

PRIME IMPLICANTS; SHADOW CLUSTERING (SC) ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 33749011712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECCTD.2005.1523139     Document Type: Conference Paper

References (3)

1. V. I. Torvik and E. Triantaphyllou, "Minimizing the average query complexity of learning monotone Boolean functions," INFORMS Journal of Computing, vol. 14, pp. 142-172, 2002.
2. B. Kovalerchuk, E. Triantaphyllou, A. S. Deshpande, and E. Vityaev, "Interactive learning of monotone Boolean functions," Information Sciences, vol. 94, pp. 87-118, 1996.
3. M. Muselli and D. Liberati, "Training digital circuits with Hamming Clustering," IEEE Transactions on Circuit and Systems-I: Fundamental Theory and Applications, vol. 47, pp. 513-527, 2000.