scientific article; zbMATH DE number 3065505
From MaRDI portal
Publication:5804648
Cited in
(9)- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Decision tree complexity and Betti numbers
- Sums of Betti numbers in arbitrary characteristic.
- Algebraic decision trees and Euler characteristics
- On sums of Betti numbers of affine varieties
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Erzeugungsgrad, VC-dimension and neural networks with rational activation function
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5804648)
