SIGN IN
SIGN UP
Further algorithmic aspects of the local lemma
Full Text:
PDF
Buy this Article
Authors:
Michael Molloy
Department of Computer Science, University of Toronto, Toronto, Canada
Bruce Reed
Equipe Combinatoire, CNRS, Université Pierre et Marie Curie Paris, France
Published in:
· Proceeding
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Pages 524-529
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-962-9
doi>
10.1145/276698.276866
1998 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 21
· Downloads (cumulative): 359
· Citation Count: 49
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
graph algorithms
probabilistic algorithms
theory
verification
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