A polynomial time algorithm for the N-Queens problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Rok Sosic
Jun Gu
Published in:
Cover Image
 
· Newsletter
ACM SIGART Bulletin Homepage archive
Volume 1 Issue 3, Oct. 1990
Pages 7-11
ACM New York, NY, USA
table of contents doi>10.1145/101340.101343
A polynomial time algorithm for the N-Queens problem Published by ACM 1990 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 26
· Downloads (12 Months): 152
· Downloads (cumulative): 897
· Citation Count: 18


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 © 2013 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