154 search results - page 6 / 31 » Equivalence Problems for Circuits over Sets of Natural Numbe... |
EOR
2006
13 years 7 months ago
2006
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
ETS
2011
IEEE
12 years 7 months ago
2011
IEEE
—As circuits continue to scale to smaller feature sizes, wearout and latent defects are expected to cause an increasing number of errors in the field. Online error detection tec...
EUROCRYPT
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...