HAL (France)
open access
Improved computation of polynomial roots over number fields when using complex embeddings
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Structure of Radical Towers and their Parametrizations#1355328
- A faster matrix multiplication algorithm through structured optimization#1247520
- Reduction numbers for witnesses to the generalized Loewy length#926200
- The Q-Calculus: A Quaternion-Based Laws of Form System#1155219
- Conjugating full cycles by adjacent transpositions: diameter and sorting time#925898
Record · ID 1203563
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive