DocumentCode :
2217447
Title :
Analysis of composition complexity and how to obtain smaller canonical graphs
Author :
Jain, J. ; Mohanram, K. ; Moundanos, D. ; Wegener, I. ; Lu, Y.
fYear :
2000
fDate :
2000
Firstpage :
681
Lastpage :
686
Keywords :
Algorithm design and analysis; Automata; Boolean functions; Computer science; Data structures; Partitioning algorithms; Permission; Robustness; Sequential circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 2000. Proceedings 2000
Print_ISBN :
1-58113-187-9
Type :
conf
DOI :
10.1109/DAC.2000.855401
Filename :
855401
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2217447
