SIGN IN
SIGN UP
A constructive proof of the Lovász local lemma
Full Text:
PDF
Buy this Article
Author:
Robin A. Moser
ETH Zurich, Zurich, Switzerland
Published in:
· Proceeding
STOC '09
Proceedings of the 41st annual ACM symposium on Theory of computing
Pages 343-350
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-506-2
doi>
10.1145/1536414.1536462
2009 Article
Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 108
· Downloads (cumulative): 1,216
· Citation Count: 20
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
bounded occurrence sat instances
combinatorial algorithms
derandomization
hypergraph colouring
lovasz local lemma
nonnumerical algorithms and problems
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder