Grigoryan (n-Queens Completion n-Queens Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3110:31, 15 February 2023‎ Admin talk contribs‎ 374 bytes +374‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Grigoryan_(n-Queens_Completion_n-Queens_Problem)"