29908 search results - page 263 / 5982 » On the Complexity of |
163
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Dirk Diekhoff, Elektrobit Automotive "The development of complex control units requires mature and reliable basic software as well as integration support particularly in e...
169
Voted
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
186
click to vote
ARITH
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...
153
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
214
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...