|
Volumn , Issue , 2006, Pages 63-66
|
Efficient algorithm for positive-polarity reed-muller expansions of reversible circuits
|
Author keywords
Boolean polynomial; Reed muller expansion; Reversible circuits; Synthesis
|
Indexed keywords
BOOLEAN FUNCTIONS;
ELECTRONICS INDUSTRY;
FUNCTION EVALUATION;
HEURISTIC ALGORITHMS;
HEURISTIC PROGRAMMING;
MICROELECTRONICS;
NETWORKS (CIRCUITS);
PARTITIONS (BUILDING);
TREES (MATHEMATICS);
DELAY CONSTRAINTS;
EFFICIENT ALGORITHMS;
HIGH PERFORMANCE;
IN ORDER;
INTERNATIONAL CONFERENCES;
MATHEMATICAL MODELLING;
PATH DELAY (PD);
PRIORITY QUEUEING;
REED-MULLER EXPANSIONS;
REVERSIBLE CIRCUITS;
SEARCH TREES;
SYNTHESIS (OF CHIRAL IONIC LIQUIDS);
SYNTHESIS METHODS;
HEURISTIC METHODS;
|
EID: 46749142121
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICM.2006.373267 Document Type: Conference Paper |
Times cited : (7)
|
References (10)
|