Sciweavers

284 search results - page 22 / 57
» On Reversible Combinatory Logic
Sort
View
ECCC
2007
109views more  ECCC 2007»
13 years 9 months ago
Logic, Graphs, and Algorithms
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
Martin Grohe
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
14 years 3 months ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
MLQ
1998
126views more  MLQ 1998»
13 years 9 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
ATS
2004
IEEE
116views Hardware» more  ATS 2004»
14 years 1 months ago
Testing for Missing-Gate Faults in Reversible Circuits
Logical reversibility occurs in low-power applications and is an essential feature of quantum circuits. Of special interest are reversible circuits constructed from a class of rev...
John P. Hayes, Ilia Polian, Bernd Becker
WCRE
2010
IEEE
13 years 8 months ago
Reverse Engineering Self-Modifying Code: Unpacker Extraction
—An important application of binary-level reverse engineering is in reconstructing the internal logic of computer malware. Most malware code is distributed in encrypted (or “pa...
Saumya K. Debray, Jay Patel