Sciweavers

5 search results - page 1 / 1
» Least and Greatest Solutions of Equations over Sets of Integ...
Sort
View
BIRTHDAY
2009
Springer
13 years 11 months ago
Polynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
Thomas Gawlitza, Jérôme Leroux, Jan R...
JCT
2007
99views more  JCT 2007»
13 years 4 months ago
Independence for partition regular equations
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...
Imre Leader, Paul A. Russell
FOCS
2009
IEEE
13 years 11 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
PODS
2008
ACM
170views Database» more  PODS 2008»
14 years 5 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis