test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
University of Toronto at Scarborough >
Computer and Mathematical Science >
Mathematics >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9484

Title: Further algorithmic aspects of the local lemma
Authors: Molloy, M.
Reed, B.
Keywords: Algorithms
Polynomials
Lovasz Local Lemma
Random processes
Issue Date: 1998
Publisher: Association for Computing Machinery
Citation: Molloy, M., & Reed, B. (1998). Further algorithmic aspects of the local lemma. Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, USA. (pp. 524-529). New York, NY, USA: ACM
Abstract: We provide a method to produce an efficient algorithm to find an object whose existence is guaranteed by the Lovasz Local Lemma. We feel that this method will apply to the vast majority of applications of the Local Lemma, unless the application has one of four problematic traits. However, proving that the method applies to a particular application may require proving two (possibly difficult) concentration-like properties.
Description: Copyright © 1998 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org. © ACM, 1998. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing (1998). http://doi.acm.org/10.1145/276698.276866
URI: http://hdl.handle.net/1807/9484
ISBN: 0-89791-962-9
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
further algorithmic aspects....pdf301.87 kBAdobe PDF
View/Open
further algorithmic aspects....pdf.txt30.37 kBText
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft