Sciweavers

IPCO
2004
128views Optimization» more  IPCO 2004»
14 years 28 days ago
Low-Dimensional Faces of Random 0/1-Polytopes
Let P be a random 0/1-polytope in d with n(d) vertices, and denote by k(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and `n(d) k+1
Volker Kaibel
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 12 months ago
A sharp threshold in proof complexity
Dimitris Achlioptas, Paul Beame, Michael S. O. Mol...