Sciweavers

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

96

MST
2010

75views more MST 2010»

Generic Complexity of Presburger Arithmetic

15 years 1 months ago

Generic Complexity of Presburger Arithmetic

Download a-server.math.nsc.ru

Alexander Rybalov

Real-time Traffic

MST 2010 |

claim paper

Related Content

» On the Use of Nondeterministic Automata for Presburger Arithmetic

» Effective Quantifier Elimination for Presburger Arithmetic with Infinity

» Deciding Boolean Algebra with Presburger Arithmetic

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

» An Algorithm for Deciding BAPA Boolean Algebra with Presburger Arithmetic

» Complexity of modal logics with Presburger constraints

» Verifying Balanced Trees

» Whats Decidable about Sequences

» New Domains for Applied Quantifier Elimination

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MST
Authors	Alexander Rybalov

Comments (0)