| http://www.w3.org/ns/prov#value | - In particular, I wonder if there is a result that there is an empty convex polytope with approximately $\Omega(\log n)$ vertices? (approximately: Perhaps mitigated by $\log \log n$ factors, etc.) If not, what is the best lowerbound that can be claimed?
|
