Limits of using signatures for permutation independent Boolean comparison

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Limits of using signatures for permutation independent Boolean comparison

Source

Asia and South Pacific Design Automation Conference archive
Proceedings of the 1995 Asia and South Pacific Design Automation Conference table of contents

Makuhari, Massa, Chiba, Japan

Article No. 74

Year of Publication: 1995

ISBN:0-89791-766-9

Authors

Janett Mohnke
Paul Molitor
Sharad Malik

Sponsors

IEEE-CAS : Circuits & Systems
IFIP WG 10.2 : IFIP WG 10.2
ISPJ : ISPJ
SIGDA: ACM Special Interest Group on Design Automation
IEICE : Inst of Electronics, Info & Communication Engineers
IFIP WG 10.5 : IFIP WG 10.5

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 10

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/224818.224955 What is a DOI?

CITED BY 10

	Jovanka Ciric , Carl Sechen, Efficient canonical form for boolean matching of complex functions in large libraries, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
	Afshin Abdollahi , Massoud Pedram, A new canonical form for fast boolean matching in logic synthesis and verification, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, San Diego, California, USA
	Giovanni Agosta , Francesco Bruschi , Donatella Sciuto, An efficient cost-based canonical form for Boolean matching, Proceedings of the 17th great lakes symposium on Great lakes symposium on VLSI, March 11-13, 2007, Stresa-Lago Maggiore, Italy
	Kuo-Hua Wang, Exploiting K-Distance Signature for Boolean Matching and G-Symmetry Detection, Proceedings of the 43rd annual conference on Design automation, July 24-28, 2006, San Francisco, CA, USA
	Giovanni Agosta , Francesco Bruschi , Gerardo Pelosi , Donatella Sciuto, A unified approach to canonical form-based Boolean matching, Proceedings of the 44th annual conference on Design automation, June 04-08, 2007, San Diego, California
	Victor N. Kravets , Karem A. Sakallah, Generalized symmetries in boolean functions, Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, November 05-09, 2000, San Jose, California
	Donald Chai , Andreas Kuehlmann, Building a better Boolean matcher and symmetry detector, Proceedings of the conference on Design, automation and test in Europe: Proceedings, March 06-10, 2006, Munich, Germany
	Leon Stok , Vivek Tiwari, Technology mapping, Logic Synthesis and Verification, Kluwer Academic Publishers, Norwell, MA, 2001
	Laura Heinrich-Litan , Paul Molitor, Least Upper Bounds for the Size of OBDDs Using Symmetry Properties, IEEE Transactions on Computers, v.49 n.4, p.360-368, April 2000
	Eugene M. Luks, Hypergraph isomorphism and structural equivalence of Boolean functions, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.652-658, May 01-04, 1999, Atlanta, Georgia, United States