Polynomial and algebraic computation
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.
Papers listed on taxonomy pages are the top few works per node from the OpenAlex snapshot. That list is not exhaustive and is not an endorsement. The topic map and the journal registry remain separate: there is still no authoritative topic-to-venue or topic-to-organization edge. Search is a lexical lookup, not a claim that a venue publishes a topic.