19320 search results - page 142 / 3864 » On the complexity of computing determinants |
162
click to vote
CIE
2010
Springer
15 years 9 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 ...
152
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
154
click to vote
RTA
2010
Springer
15 years 8 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...
125
Voted
ICS
2005
Tsinghua U.
15 years 10 months ago
2005
Tsinghua U.
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
145
click to vote
DEXAW
2005
IEEE
15 years 10 months ago
2005
IEEE
In the domain of bioinformatics, the role played in the biological process by proteins, that act as transmitters and receivers of information thus ruling the mechanisms that deter...