3897 search results - page 12 / 780 » complexity 2010 |
64
Voted
MSCS
2010
14 years 5 months ago
2010
85
Voted
JCAM
2010
14 years 5 months ago
2010
The classical singular value decomposition for a matrix A Cm
77
Voted
SIAMADS
2010
14 years 5 months ago
2010
Reduced-order models of the nonlinear complex Ginzburg
94
Voted
CIE
2010
Springer
15 years 3 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
93
Voted
RTA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...