134 search results - page 10 / 27 » Reversible logic for supercomputing |
TBILLC
2005
Springer
15 years 5 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ā¤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deļ...
APCCM
2009
15 years 25 days ago
2009
It is frequent in practice that different logical XML schemas representing the same reality from different viewpoints exist. There is also usually a conceptual diagram modeling th...
CDES
2008
15 years 1 months ago
2008
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
INTEGRATION
2008
14 years 11 months ago
2008
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
100
click to vote
ISMVL
2009
IEEE
15 years 6 months ago
2009
IEEE
Determining the equivalence of reversible circuits designed to meet a common speciļ¬cation is considered. The circuitsā primary inputs and outputs must be in pure logic states ...