ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

A polynomial time computation of the exact correlation structure of k-satisfiability landscapes

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Andrew M. Sutton Colorado State University, Fort Collins, CO, USA
L. Darrell Whitley Colorado State University, Fort Collins, CO, USA
Adele E. Howe Colorado State University, Fort Collins, CO, USA
Published in:
Cover Image
 
· Proceeding
GECCO '09 Proceedings of the 11th Annual conference on Genetic and evolutionary computation
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-325-9 doi>10.1145/1569901.1569952
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 14
· Citation Count: 6


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder