| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
All CFPs on WikiCFP | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Present CFP : 2022 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Important dates
Regular papers Abstract submission: January 31, 2022, 23:59 (anywhere on Earth) Paper submission: February 7, 2022, 23:59 (anywhere on Earth) First notification of acceptance/rejection: April 17, 2022 End of rebuttal phase: May 1, 2022 Final notification after rebuttal phase: May 8, 2022 Camera-ready copy due: May 15, 2022 Conference topics All areas of computer algebra and symbolic computation are of interest at ISSAC 2022. These include, but are not limited to: Algorithmic aspects: Exact and symbolic linear, polynomial and differential algebra Symbolic-numeric, homotopy, perturbation and series methods Computational algebraic geometry, group theory and number theory, quantifier elimination and logic Computer arithmetic Summation, recurrence equations, integration, solution of ODEs & PDEs Symbolic methods in other areas of pure and applied mathematics Complexity of algebraic algorithms and algebraic complexity Software aspects: Design of symbolic computation packages and systems Language design and type systems for symbolic computation Data representation Considerations for modern hardware Algorithm implementation and performance tuning Mathematical user interfaces Use with systems for, e.g., digital libraries, courseware, simulation and optimization, automated theorem-proving, computer-aided design, and automatic differentiation. Application aspects: Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|