Sciweavers

284 search results - page 8 / 57
» On Reversible Combinatory Logic
Sort
View
AMEC
2004
Springer
14 years 3 months ago
Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
Vincent Conitzer, Tuomas Sandholm
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 4 months ago
Efficient Approaches for Designing Fault Tolerant Reversible Carry Look-Ahead and Carry-Skip Adders
Combinational or Classical logic circuits dissipate heat for every bit of information that is lost. Information is lost when the input vector cannot be recovered from its correspon...
Md. Saiful Islam 0003, Muhammad Mahbubur Rahman, Z...
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
13 years 10 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
DAC
2003
ACM
14 years 11 months ago
A transformation based algorithm for reversible logic synthesis
A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are of interest in quantum computing, optical computing...
D. Michael Miller, Dmitri Maslov, Gerhard W. Dueck
EJC
2010
13 years 10 months ago
On the distance between the expressions of a permutation
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
Patrick Dehornoy, Marc Autord