233 search results - page 1 / 47 » Semantical Counting Circuits |
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
KGC
1997
Springer
13 years 9 months ago
1997
Springer
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
CSR
2009
Springer
14 years 14 hour ago
2009
Springer
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...
CODES
2008
IEEE
13 years 12 months ago
2008
IEEE
Modern embedded compute platforms increasingly contain both microprocessors and field-programmable gate arrays (FPGAs). The FPGAs may implement accelerators or other circuits to s...
ISLPED
1995
ACM
13 years 9 months ago
1995
ACM
Thispaper proposes a method for achieving low-power control-logic modules using a combination of CMOS complex gate reorganization, transistor size optimization, and transistor lay...