10 search results - page 1 / 2 » Towards factoring bivariate approximate polynomials |
ISSAC
2001
Springer
15 years 1 months ago
2001
Springer
JSC
2006
14 years 9 months ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
103
Voted
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...