3208 search results - page 394 / 642 » A Lower Bound for Primality |
188
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
178
click to vote
ISCAS
1995
IEEE
15 years 10 months ago
1995
IEEE
— This paper introduces a simple analytical model for estimating standby and switching power dissipation in deep submicron CMOS digital circuits. The model is based on Berkeley S...
167
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
170
click to vote
AAAI
2007
15 years 9 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
157
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
The problem of characterizing lower bounds on data-rates needed for closed loop stability has been solved in a variety of settings. However, the available results lead to coding s...