15073 search results - page 198 / 3015 » Probabilistic algorithms for computing resultants |
136
Voted
ACMSE
2006
ACM
15 years 7 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
116
Voted
DIMACS
2001
15 years 5 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
172
click to vote
MOC
1998
15 years 3 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
134
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
E-commerce has transformed the way firms develop their pricing strategies, producing shift away from fixed pricing to dynamic pricing. In this paper, we use two different Estim...
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
ct Computer generated academic papers have been used to expose a lack of thorough human review at several computer science conferences. We assess the problem of classifying such do...