Research map / Learning theory and algorithms / Matrix and tensor methods
Polynomial Solvers for Saturated Ideals
Viktor Larsson, Kalle Astrom, Magnus Oskarsson
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| saturate directly with 1 + s^T s instead of adding an auxiliary variable | vanishing point solver · York Urban vanishing point estimation | execution time: 1.8 s -> 5 ms | Improved |
| saturate directly instead of auxiliary variable | vanishing point solver · York Urban vanishing point estimation | elimination template size: 2, 860 × 3, 060 -> 246 × 397 | Improved |
| saturate directly instead of auxiliary variable | vanishing point solver · York Urban vanishing point estimation | RMS consistency error | No clear effect |
| use automatic saturation instead of manual saturation with 128 bit arithmetic | three-view triangulation solver · Three-view optimal triangulation | execution time: > 1 s -> 10 ms | Improved |
| use new parametrization (ablation) | three-view triangulation solver · Three-view optimal triangulation | elimination template size: 571 × 676 -> 209 × 265 | Improved |
| use new parametrization (ablation) | three-view triangulation solver · Three-view optimal triangulation | execution time: 10 ms -> 3 ms | Improved |
| use saturation-based solver instead of Kuang et al. solver | time-of-arrival (4,6) solver · Time-of-arrival self-calibration | execution time: 0.6 s -> 22 ms | Improved |
| use saturation-based solver instead of Kuang et al. solver | time-of-arrival (5,5) solver · Time-of-arrival self-calibration | execution time: 1.4 s -> 95 ms | Improved |
| use saturation-based solver instead of Kuang et al. solver | time-of-arrival solver · Time-of-arrival self-calibration | residual accuracy | No clear effect |
| use saturated-ideal solver instead of basis-selection solver of Byrod et al. | three-view triangulation solver · Three-view optimal triangulation | execution time: 3 ms -> 10 ms | Hurt |
Closest papers by meaning
- Automatic Solver Generator for Systems of Laurent Polynomial Equations (IJCV 2026 · similarity 0.87)
- Approximate Vanishing Ideal Computations at Scale (ICLR 2023 · similarity 0.84)
- Learning to compute Gröbner bases (NeurIPS 2024 · similarity 0.84)
- Automated Proof of Polynomial Inequalities via Reinforcement Learning (CVPR 2025 · similarity 0.83)
- Learning Polynomial Problems with $SL(2, \mathbb{R})$-Equivariance (ICLR 2024 · similarity 0.82)
- Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization (AAAI 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
