2 papers
math.AG2020
Sampling and homology via bottlenecks
Sandra Di Rocco, David Eklund, Oliver Gäfvert
In this paper we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing of…
math.AG2019
Computational complexity of learning algebraic varieties
Oliver Gäfvert
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in . The complexity measure, called the algebraic complexit…