International Symposium on Symbolic and Algebraic Computation (ISSAC) 2020
20-07-2020 έως 22-07-2020
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2020 will be the 45th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, poster sessions, software demonstrations and vendor exhibits with a center-piece of contributed research papers.
Due to the COVID-19 pandemic, ISSAC 2020 will be organized as a virtual conference. The real-time part of the symposium will be limited to three hours, starting at 3pm EET (12.00 noon UTC), each day from July 20 to 22.
All areas of computer algebra and symbolic computation are of interest at ISSAC 2020. 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.
For more information visit the page here.