734 search results - page 7 / 147 » A polynomial quantum algorithm for approximating the Jones p... |
TCS
2008
13 years 8 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
MP
2010
13 years 7 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
STOC
1989
ACM
14 years 18 days ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
STOC
1993
ACM
14 years 19 days ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
STOC
1998
ACM
14 years 24 days ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...