scientific article; zbMATH DE number 3065505
From MaRDI portal
Publication:5804648
zbMATH Open0042.39704MaRDI QIDQ5804648FDOQ5804648
Authors: Olga Arsenevna Oleĭnik 
Publication date: 1951
Title of this publication is not available (Why is that?)
Cited In (7)
- 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
- Sums of Betti numbers in arbitrary characteristic.
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Decision tree complexity and Betti numbers
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Algebraic decision trees and Euler characteristics
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)
