Grigoryan (n-Queens Completion n-Queens Problem)
Revision as of 11:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (Derived: two control arrays of size O(n)) == Description == == Approximate? == Approximate Approximation Factor: error < 0.0001 and decreases with increasing n == Randomized? == Yes, Monte Carlo == Model of Computation == == Year == 2018 == Reference == https://arxiv.org/abs/1912.05935")
Time Complexity
$O(n)$
Space Complexity
$O(n)$
(Derived: two control arrays of size O(n))
Description
Approximate?
Approximate
Approximation Factor: error < 0.0001 and decreases with increasing n
Randomized?
Yes, Monte Carlo
Model of Computation
Year
2018