Brute-force search (3-Graph Coloring Graph Coloring): 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.

10 April 2023

15 February 2023

  • curprev 11:3211:32, 15 February 2023‎ Admin talk contribs‎ 284 bytes +284‎ Created page with "== Time Complexity == $O((n+m)*{3}^n)$ == Space Complexity == $O(n)$ auxiliary words ((can be easily derived)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1852 == Reference == -"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Brute-force_search_(3-Graph_Coloring_Graph_Coloring)"