Gunther Determinants solution (Counting Solutions; Constructing solutions n-Queens Problem)
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n!)$ == Space Complexity == $O(n!)$ ? words (Seems like this one lists out all of the terms in the discriminant; presumably there is a better way but that amounts to the naive algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1874 == Reference ==")
Time Complexity
$O(n!)$
Space Complexity
$O(n!)$ ? words
(Seems like this one lists out all of the terms in the discriminant; presumably there is a better way but that amounts to the naive algorithm)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1874