14774 search results - page 454 / 2955 » Computational complexity and evolutionary computation |
155
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
203
click to vote
COMPUTING
2010
15 years 4 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
191
click to vote
GRID
2000
Springer
15 years 10 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
135
Voted
DAC
2000
ACM
16 years 7 months ago
2000
ACM
125
Voted
DAC
2001
ACM
16 years 7 months ago
2001
ACM