Polynomial and algebraic computation

Polynomial and algebraic computation is a research topic within Computational Theory and Mathematics. Science Explorer counts 20k research works in it since 1950. 10.1% of them reached the world's top 10% most cited for their field and year.

This cluster of papers covers topics in symbolic computing, including efficient algorithms for solving polynomial systems, Gröbner bases computation, tropical geometry, and applications in cryptography such as cryptanalysis of various cryptosystems. It also explores numerical methods for algebraic geometry and the use of max-plus algebra in certain computational problems.

• Symbolic Computing
• Gröbner Bases
• Tropical Geometry
• Polynomial Systems
• Cryptanalysis
• Algebraic Varieties
• Numerical Algebraic Geometry
• Multivariate Polynomials
• Homotopy Continuation
• Max-Plus Algebra