Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Solving Sparse Linear Constraints

From MaRDI portal
Publication:3613428
Jump to:navigation, search

DOI10.1007/11814771_39zbMATH Open1222.68368OpenAlexW2141447199MaRDI QIDQ3613428FDOQ3613428


Authors: Shuvendu K. Lahiri, Madanlal Musuvathi Edit this on Wikidata


Publication date: 12 March 2009

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814771_39




Recommendations

  • Tools and Algorithms for the Construction and Analysis of Systems
  • Equality detection for linear arithmetic constraints
  • Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
  • New techniques for linear arithmetic: cubes and equalities
  • Solving linear constraints over real and rational fields


Mathematics Subject Classification ID



Cited In (1)

  • Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds





This page was built for publication: Solving Sparse Linear Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613428)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3613428&oldid=17038134"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 04:18. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki