Complexity Theory: Revision history

From Rice Wiki

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.

13 March 2024

  • curprev 01:0901:09, 13 March 2024‎ Rice talk contribs‎ 860 bytes +216‎ No edit summary
  • curprev 00:3300:33, 13 March 2024‎ Rice talk contribs‎ 644 bytes +83‎ No edit summary
  • curprev 00:3100:31, 13 March 2024‎ Rice talk contribs‎ 561 bytes +561‎ Created page with "There exists problems that cannot be solved fast. '''Complexity theory''' is the classification of problems into ''classes''. * P: Set of problems for which exists an algorithm that solves it in poly time O(n^k). * NP: Set of problems for which there exists an algorithm that verifies the solution in poly time = Independent Set Problem = Consider a graph G(V,E). Find the largest set of vertices such that they do not share edges. == Approach: Brute Force == For all po..."
Retrieved from "http://ricefriedegg.com:80/mediawiki/index.php/Complexity_Theory"