# Polynomial and algebraic computation

{
  "id": "T11435",
  "title": "Polynomial and algebraic computation",
  "url": "/topics/T11435",
  "kind": "topic-directory",
  "aeo_cohort": "topic-directory",
  "provider": "openalex",
  "revision": "3ee7ed9b40d5446a",
  "catalogue_revision": "f050b5d4780b1289",
  "numeric_address": "36183006758733023",
  "address_version": "morton4x16-v1",
  "coordinates": [
    3,
    17,
    1703,
    11435
  ],
  "answer_status": "Directory metadata; local answer requires separate source review",
  "truth_status": "Subject descriptor, not a factual answer or a demonstrated knowledge gap"
}

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.

Directory metadata is not a factual answer or evidence of a global knowledge gap.

Source: https://openalex.org/T11435

No owner-reviewed local answer yet.