collaborators

1 paper

math.OC2024

A Deterministic Algorithm of Quasi-Polynomial Complexity for Clipped Cubes Volume Approximation

Marius Costandin

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be…