All Stories

  1. First-Order Tests for Toricity
  2. Positive Solutions of Systems of Signed Parametric Polynomial Inequalities
  3. A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications
  4. Satisfiability checking and symbolic computation
  5. Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks
  6. Subtropical Satisfiability
  7. Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
  8. Better answers to real questions
  9. $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
  10. Foreword to the Special Focus on Constraints and Combinations
  11. Subtropical Real Root Finding
  12. Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
  13. Linear Integer Arithmetic Revisited
  14. Towards Conflict-Driven Learning for Virtual Substitution
  15. Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
  16. Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages
  17. Foreword
  18. Algorithmic Global Criteria for Excluding Oscillations
  19. On Muldowney’s Criteria for Polynomial Vector Fields with Constraints
  20. Automatic Verification of the Adequacy of Models for Families of Geometric Objects
  21. Verification and synthesis using real quantifier elimination
  22. Parametric quantified SAT solving
  23. Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
  24. Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests
  25. Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology
  26. Effective Quantifier Elimination for Presburger Arithmetic with Infinity
  27. Editorial
  28. Weak quantifier elimination for the full linear theory of the integers
  29. Editorial
  30. New Domains for Applied Quantifier Elimination
  31. Quantifier Elimination for Constraint Logic Programming
  32. Efficient projection orders for CAD
  33. A generic projection operator for partial cylindrical algebraic decomposition
  34. Applications of Computer Algebra
  35. Integration of Quantifier Elimination with Constraint Logic Programming
  36. Artificial Intelligence, Automated Reasoning, and Symbolic Computation
  37. Parametric Systems of Linear Congruences
  38. Linear Problems in Valued Fields
  39. An Algebraic Approach to Offsetting and Blending of Solids
  40. Reasoning over Networks by Symbolic Methods
  41. P-adic constraint solving
  42. Real Quantifier Elimination in Practice
  43. Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
  44. Weak Integer Quantifier Elimination Beyond the Linear Case