activity
20072021
most citedAlgorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer

66 citations · 175 across the 15 of their papers we have counts for

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2009★ 3 cited

Automated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles

Francesco De Comite, Jean-Paul Delahaye

We propose a method for computing upper bounds for the Heilbronn problem for triangles.