120 search results - page 10 / 24 » Functions Definable by Arithmetic Circuits |
GLVLSI
2010
IEEE
14 years 15 days ago
2010
IEEE
NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture leve...
IASTEDCCS
2004
13 years 8 months ago
2004
Unlike the classical deterministic digital circuit analysis, we consider the analysis of uncertain digital circuits defined as follows. Given a binary function of n uncertain inpu...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
STOC
1989
ACM
13 years 11 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
IPL
2007
13 years 7 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...