66 search results - page 2 / 14 » Computing All Integer Solutions of a General Elliptic Equati... |
77
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
162
click to vote
GIS
2006
ACM
15 years 10 months ago
2006
ACM
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
JCT
2007
14 years 9 months ago
2007
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
DAGSTUHL
2004
14 years 11 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
CSR
2009
Springer
14 years 10 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...