77 search results - page 13 / 16 » Boolean Circuits and a DNA Algorithm in Membrane Computing |
GLVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...