Skip to content

Opening book details…

About this Computer Science article

On the satisfiability threshold and clustering of solutions of random 3-SAT formulas by Elitza Maneva; Alistair Sinclair is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Elitza Maneva; Alistair Sinclair
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)
Published
2008
Field
Computer Science (Physical Sciences)

More by Elitza Maneva; Alistair Sinclair

Browse all works by Elitza Maneva; Alistair Sinclair