Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

101

PLDI
1994
ACM

94views Programming Languages» more PLDI 1994»

Counting Solutions to Presburger Formulas: How and Why

15 years 7 months ago

Counting Solutions to Presburger Formulas: How and Why

Download www.lib.umd.edu

William Pugh

Real-time Traffic

PLDI 1994 | Programming Languages |

claim paper

Related Content

» An AutomataTheoretic Algorithm for Counting Solutions to Presburger Formulas

» Memory optimization by counting points in integer transformations of parametric polytopes

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	PLDI
Authors	William Pugh

Comments (0)