Cooper, Colin, Frieze, Alan and Sorkin, Gregory B. (2002) A note on random 2-SAT with prescribed literal degrees. In: Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms , 6-8 January 2002, San Francisco, CA, USA.
Two classic\phase transitions" in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a random 2-SAT formula from satisfiable to unsatisfiable as the density of clauses increases. The random-graph result has been extended to the case of prescribed degree sequences, where the almost-sure nonexistence or existence of a giant component is related to a simple property of the degree sequence. We similarly extend the satisfiability result, by relating the almost-sure satisfiability or unsatisfiability of a random 2-SAT formula to an analogous property of a prescribed literal sequence.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||© The Authors|
|Library of Congress subject classification:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Sets:||Research centres and groups > Management Science Group
Departments > Management
|Date Deposited:||13 May 2011 12:48|
Actions (login required)
|Record administration - authorised staff only|