10608 search results - page 126 / 2122 » Complexity of O'Hara's Algorithm |
140
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
111
click to vote
AIPS
2000
15 years 4 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
129
click to vote
JOC
2006
15 years 3 months ago
2006
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
121
click to vote
ISCAS
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
131
click to vote
IFIPTCS
2000
15 years 6 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...