Rivin, Zabih (Counting Solutions n-Queens Problem)
Jump to navigation
Jump to search
Time Complexity
$O({8}^n*poly(n)$)
Space Complexity
$O({8}^n*n^{2})$ words
(http://www.cs.cornell.edu/~rdz/Papers/RZ-IPL92.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1992