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/9462

Title: A probabilistic analysis of randomly generated binary constraint satisfaction problems
Authors: Molloy, M.
Dyer, M.
Frieze, A.
Issue Date: 2003
Publisher: Elsevier Science Publishers Ltd
Citation: Dyer, M., Frieze, A., Molloy, M. (2003). A probabilistic analysis of randomly generated binary constraint satisfaction problems. [Electronic version]. Theoretical Computer Science Archive, 290(3), 1815-1828
Description: www.elsevier.com/wps/find/journaldescription.cws_home/505625/description#description
URI: http://hdl.handle.net/1807/9462
ISSN: 0304-3975
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
post print-A probablistic analysis of randomly....pdf291.17 kBAdobe PDF
View/Open

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

uoft