Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
111
Voted
IPCO
2004
128
views
Optimization
»
more
IPCO 2004
»
Low-Dimensional Faces of Random 0/1-Polytopes
15 years 4 months ago
Download
www.math.uni-magdeburg.de
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
claim paper
Read More »
93
Voted
STOC
2001
ACM
161
views
Algorithms
»
more
STOC 2001
»
A sharp threshold in proof complexity
16 years 3 months ago
Download
www.cs.washington.edu
Dimitris Achlioptas, Paul Beame, Michael S. O. Mol...
claim paper
Read More »