Sciweavers

43 search results - page 1 / 9
» Arithmetic completely regular codes
Sort
View
DM
2008
59views more  DM 2008»
13 years 3 months ago
On non-antipodal binary completely regular codes
Joaquim Borges, Josep Rifà, Victor A. Zinov...
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
14 years 4 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
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 ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 4 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
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...
Aless Lasaruk, Thomas Sturm
ISSAC
2009
Springer
169views Mathematics» more  ISSAC 2009»
13 years 10 months ago
Computations modulo regular chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
Xin Li, Marc Moreno Maza, Wei Pan
PLDI
2010
ACM
14 years 1 months ago
Complete Functional Synthesis
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...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...