3897 search results - page 12 / 780 » complexity 2010 |
MSCS
2010
13 years 2 months ago
2010
JCAM
2010
13 years 2 months ago
2010
The classical singular value decomposition for a matrix A Cm
SIAMADS
2010
13 years 2 months ago
2010
Reduced-order models of the nonlinear complex Ginzburg
CIE
2010
Springer
14 years 11 days 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 ...
RTA
2010
Springer
13 years 11 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...