AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Automatic Solver Generator for Systems of Laurent Polynomial Equations

Evgeniy Martyushev, Snehal Bhayani, Tomáš Pajdla

IJCV 2026 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized sketching for matrices · 2 citations (OpenAlex)

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 changedWhereMeasuredEffect
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Unsynch. rel. pose (#11)runtime (ms): 0.6 -> 0.3Improved
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Rel. pose lambda1+E+lambda2 7pt (#21)runtime (ms): 27.9 -> 4.2Improved
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Optimal 3-view triangulation (#35)runtime (ms): 5.7 -> 1.1Improved
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Time-of-Arrival (4,6) (#31)runtime (ms): 17.1 -> 5.2Improved
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Optimal PnP Cayley (#12)runtime (ms): 0.9 -> 1.1Hurt
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Gen. rel. pose + scale 7pt (#24)runtime (ms): 9.2 -> 9.7Hurt
use Laurent-polynomial template generator instead of greedy generatorTemplate solver · Weak PnP (#26)mean numerical error (log10): -12.36 -> -10.32Hurt
use our generated solver instead of STD solverOptimal 3-view triangulation · synthetictime per call (ms): 1.54 -> 1.34Improved
use our generated solver instead of QR solverOptimal 3-view triangulation · syntheticfailure rate error>1 (%): 0.29% -> 1.11%Hurt
use depth formulation instead of homography formulation (Groebner basis)H13f solver · synthetictime per call (ms): 27.41 -> 1.10Improved
use depth formulation instead of homography formulation (resultant)H13f solver · syntheticfailure rate error>1 (%): 0.06% -> 0.02%Mixed
use our ToA (5,5) solver instead of prior solverToA solver · synthetictime per call (ms): 33.55 -> 18.68Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy