5-point star Cramer's rule (2-Dimensional Poisson Problem Poisson 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 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 463 bytes +463‎ Created page with "== Time Complexity == $O({4}^{(n^{2})})$ == Space Complexity == $O({4}^{(n^{2})})$ for sure, $O(n^{2})$ possibly??? (if super conservative) words (For expansion by minors, each "level" of expansion requires computing and storing O(1) smaller determinants, and there are O(n^2) levels overall) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1945 == Reference =="
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/5-point_star_Cramer%27s_rule_(2-Dimensional_Poisson_Problem_Poisson_Problem)"