Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.

DOI10.4230/lipics.socg.2020.8OpenAlexW3038092457MaRDI QIDQ6059955

Boris Aronov, Esther Ezra, Micha Sharir

Publication date: 2 November 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12166/pdf/LIPIcs-SoCG-2020-8.pdf/

zbMATH Keywords

algebraic decision treecollinearity testingpolynomial partition3SUM-hard problemspolynomials vanishing on Cartesian products

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Geometric pattern matching reduces to \(k\)-SUM ⋮ On Ray Shooting for Triangles in 3-Space and Related Problems ⋮ Geometric Pattern Matching Reduces to k-SUM. ⋮ On 3SUM-hard problems in the decision tree model

This page was built for publication: Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.