arXiv (All)
open access
Squaring Up by Selection: NP-Completeness at Three Simple Roots
To solve an overdetermined polynomial system numerically, one first makes it square, usually by replacing the given equations with as many random linear combinations as there are unknowns. This is a provably safe step, but it can substantially enlarge the supports. The alternative is to keep that ma
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
- Additive reduced basis preconditioners for large-scale parametrized PDEs#998653
- Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking#997434
- Accelerating Multiple-Precision LU Decomposition with Ozaki Scheme II#1077482
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
- A randomized global GMRES method for matrix equations#972415
Record · ID 1076565
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