43 search results - page 1 / 9 » Arithmetic completely regular codes |
DM
2008
13 years 11 months ago
2008
VLSID
2002
IEEE
14 years 11 months ago
2002
IEEE
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
CASC
2009
Springer
13 years 12 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
ISSAC
2009
Springer
14 years 5 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
PLDI
2010
ACM
14 years 8 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...