Pages that link to "Item:Q1272610"

The following pages link to A new approach for automatic theorem proving in real geometry (Q1272610):

Displaying 17 items.

• On the complexity of quantified linear systems (Q391791) (← links)
• A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
• Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
• Algorithmic global criteria for excluding oscillations (Q542032) (← links)
• Better answers to real questions (Q898260) (← links)
• Connecting the 3D DGS Calques3D with the CAS Maple (Q974253) (← links)
• Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. (Q1568438) (← links)
• Linear problems in valued fields (Q1582303) (← links)
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
• A review and prospect of readable machine proofs for geometry theorems (Q2439882) (← links)
• Multiple object semilinear motion planning (Q2457425) (← links)
• Rewriting input expressions in complex algebraic geometry provers (Q2631957) (← links)
• Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology (Q3599203) (← links)
• Real World Verification (Q5191121) (← links)
• Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems (Q5453488) (← links)
• Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom? (Q6157640) (← links)