Search results
Jump to navigation
Jump to search
- ...tive''''' proofs that we are going to introduce later, which are basically algorithms. ...gorithm as well as its output is ''deterministic''. But for ''randomized'' algorithms, the behavior of <math>\mathsf{Alg}(r, \phi)</math> is a random variable ev ...31 KB (5,614 words) - 12:29, 8 December 2015
- ...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...34 KB (6,244 words) - 15:28, 8 June 2013
- ...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...37 KB (6,824 words) - 02:20, 29 December 2015
- ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...15 KB (2,781 words) - 06:17, 29 September 2021
- ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...15 KB (2,781 words) - 16:38, 26 September 2023
- ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...15 KB (2,781 words) - 15:47, 3 October 2022
- ...(meaning there is no parallel edges) with no edge weight, there are better algorithms. A deterministic algorithm of [https://dl.acm.org/citation.cfm?id=2746588 K ...possible instances''. This notion is formally captured by '''approximation algorithms''' and '''approximation ratio'''. ...49 KB (8,708 words) - 08:53, 14 September 2023
- ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...16 KB (2,812 words) - 06:21, 21 November 2011
- ...raphs] have found extensive applications in computer science, in designing algorithms, [http://en.wikipedia.org/wiki/Error_correcting_code error correcting codes ...te. Studies of these two problems revolutionized the area of approximation algorithms. ...41 KB (7,547 words) - 09:24, 22 May 2023
- In [[Randomized Algorithms (Spring 2010)/Tail inequalities|lecture 4]], we show the following theorem ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...37 KB (6,743 words) - 09:07, 13 November 2011
- ...lexity model, the local computational costs are ignored. The complexity of algorithms (also called communication protocols here) are measured by the number of bi ...16 KB (2,886 words) - 07:49, 13 November 2011
- [[Category:Algorithms]] ...14 KB (2,168 words) - 11:19, 5 August 2017
- ...procedure has some generality. It is actually pretty common in randomized algorithms. The followings are some examples: ...19 KB (3,431 words) - 06:53, 14 April 2014
- ...is a structure shared by a class of optimization problems for which greedy algorithms work. ...18 KB (3,203 words) - 10:44, 4 January 2011
- In [[Randomized Algorithms (Spring 2010)/Tail inequalities|lecture 4]], we show the following theorem ...f hash tables is now considered to be the birth of the area of analysis of algorithms. ...42 KB (7,662 words) - 08:41, 7 June 2010
- ...lexity model, the local computational costs are ignored. The complexity of algorithms (also called communication protocols here) are measured by the number of bi ...20 KB (3,617 words) - 01:24, 8 June 2010
- * ''Cameron'', Combinatorics: Topics, Techniques, Algorithms, Chapter 4. ...20 KB (3,444 words) - 04:53, 7 October 2010
- We will show that on any instance of the Max-SAT, one of the two algorithms is a <math>\frac{3}{4}</math>-approximation algorithm. ...24 KB (4,382 words) - 07:27, 21 April 2014
- We will show that on any instance of the Max-SAT, one of the two algorithms is a <math>\frac{3}{4}</math>-approximation algorithm. ...24 KB (4,382 words) - 10:07, 24 May 2013
- ...is a structure shared by a class of optimization problems for which greedy algorithms work. ...24 KB (4,341 words) - 13:24, 11 December 2011