Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Computational Lower Bounds for Colourful...
Journal article

Computational Lower Bounds for Colourful Simplicial Depth

Abstract

The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained

Authors

Deza A; Stephen T; Xie F

Journal

, , ,

Publication Date

October 29, 2012