2446 search results - page 27 / 490 » Choiceless Polynomial Time |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
Sampling error due to jitter, or noise in the sample times, affects the precision of analog-to-digital converters in a significant, nonlinear fashion. In this paper, a polynomial...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
ISSAC
2009
Springer
14 years 2 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...