Fast simplifications for Tarski formulas

DOI10.1145/1576702.1576714MaRDI QIDQ2883801zbMATH OpenOpenAlexFDO

Authors Christopher W. Brown

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1576702.1576714

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast simplifications for Tarski formulas based on monomial inequalities
• scientific article; zbMATH DE number 1852135
• A Faster Algorithm for Finding Tarski Fixed Points
• Algorithmic simplification of tensor expressions
• Simplification rules for constrained formula tableaux
• Accelerating tableaux proofs using compact representations
• The approximating capability of fast forms
• Faster computation of the Tate pairing
• scientific article; zbMATH DE number 6698765
• On complexity reduction of \(\Sigma_1\) formulas

Cited in

(3)

• From simplification to a partial theory solver for non-linear real polynomial constraints
• Black-box/white-box simplification and applications to quantifier elimination
• Fast simplifications for Tarski formulas based on monomial inequalities

This page was built for publication: Fast simplifications for Tarski formulas

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