Search T-Space 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
 Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/9463

 Title: The resolution complexity of random constraint satisfaction problems Authors: Molloy, M.Salavatipour, M. Issue Date: 2003 Publisher: IEEE Citation: Molloy, M., & Salavatipour, M. (2003). The Resolution Complexity of Random Constraint Satisfaction Problems. , Proceedings. 44th Annual IEEE Symposium on the Foundations of Computer Science:330- 339 Abstract: We consider random instances of constraint satisfaction problems where each variable has domain size d, and each constraint contains t restrictions on k variables. For each (d, k, t) we determine whether the resolution complexity is a.s. constant, polynomial or exponential in the number of variables. For a particular range of (d, k, t), we determine a sharp threshold for resolution complexity where the resolution complexity drops from a.s. exponential to a.s. polynomial when the clause density passes a specific value. Description: “©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.” This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://ieeexplore.ieee.org/search/wrapp URI: http://hdl.handle.net/1807/9463 Rights: IMPORTANT NOTICE: TO USERS OF THIS DATA ALL DATA WAS COLLECTED THROUGH THE CONSIDERABLE EFFORTS OF THE RESEARCHERS CONTRIBUTING TO IT. WHILE THE DATA CAN BE USED FOR NEW ANALYSES, Contact should be main to the collector of this data prior to publication and ACKNOWLEDGEMENT MUST BE EXPLICITLY MADE AS TO THE COLLECTOR AND CONTRIBUTOR OF THESE DATA. Appears in Collections: Mathematics

Files in This Item:

File Description SizeFormat
the resolution complexity of random.....pdf532.12 kBAdobe PDF
View/Open

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