Sciweavers

6 search results - page 2 / 2
» Cosmological lower bound on the circuit complexity of a smal...
Sort
View
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 5 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett