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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
32
click to vote
IPCO
2004
128
views
Optimization
»
more
IPCO 2004
»
Low-Dimensional Faces of Random 0/1-Polytopes
14 years 28 days 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 »
24
click to vote
STOC
2001
ACM
161
views
Algorithms
»
more
STOC 2001
»
A sharp threshold in proof complexity
14 years 12 months ago
Download
www.cs.washington.edu
Dimitris Achlioptas, Paul Beame, Michael S. O. Mol...
claim paper
Read More »