Sylvester-Gallai type theorems for quadratic polynomials

DOI10.19086/da.14492zbMath1456.68039arXiv1904.06245MaRDI QIDQ5126776

Amir Shpilka

Publication date: 20 October 2020

Published in: discrete Analysis, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.06245

zbMATH Keywords

combinatorics; quadratic polynomials; arithmetic circuits; polynomial identity testing; Sylvester-Gallai theorem

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

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

52C10: Erd?s problems and related topics of discrete geometry

68W20: Randomized algorithms

68Q06: Networks and circuits as models of computation; circuit complexity