Search results

...r <math>v</math> is adjacent to a vertex in <math>D</math>. The problem of computing minimum dominating set is NP-hard. ...

...ok.html|title = Proceedings of the Third Annual ACM Symposium on Theory of Computing|pages = 151–158}}</ref> ...ust 1% of the worst-case number of computation and that saves a ''lot'' of computing, but that is still <math>0.01 \times (2^n)</math> computations. And every e ...

|data17 = '''Probability and Computing''' (2E) <br> Michael Mitzenmacher and Eli Upfal <br> Cambridge University * '''[MU]''' ''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis ...

Computing the moment generating function <math>\mathbf{E}[e^{\lambda X}]</math>: We propose an extremely simple "randomized algorithm" for computing a <math>b\in\{-1,+1\}^m</math>: for each <math>i=1,2,\ldots, m</math>, let ...

...tudies of algorithms for elimination orderings in combinatorial scientific computing, our result is the first rigorous incorporation of randomized tools in this :Huacheng Yu (俞华程) is a postdoctoral researcher in the Theory of Computing group at Harvard University. He obtained his PhD from Stanford University i ...

We propose an extremely simple "randomized algorithm" for computing a <math>b\in\{-1,+1\}^m</math>: for each <math>i=1,2,\ldots, m</math>, let ...

...> multiplications, which is too expensive. We describe an efficient way of computing the [http://en.wikipedia.org/wiki/Modular_exponentiation modular exponent] ...ed a number instead of a list of all colorings, we expect cleverer ways of computing this number than the brute force enumeration. ...

...he search for new Mersenne primes is the goal of the [[GIMPS]] distributed computing project. *[http://www.oddperfect.org OddPerfect.org] A projected distributed computing project to search for odd perfect numbers. ...

|data13 = Mitzenmacher and Upfal. <br>''Probability and Computing: Randomized Algorithms and Probabilistic Analysis''. <br> Cambridge Univ Pr ...

[[Decryption]] of a ciphertext <math>(R_n, L_n)</math> is accomplished by computing for <math>i=n,n-1,\ldots,1</math> ...

...]</math> by the definition of expectations. There is also a smarter way of computing <math>\mathbf{E}[X]</math>, by using indicators and the linearity of expec ...e need the following theorem, which holds generally and is very useful for computing the AND of many events. ...

|data13 = Mitzenmacher and Upfal. <br>''Probability and Computing: Randomized Algorithms and Probabilistic Analysis''. <br> Cambridge Univ Pr ...

Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su === Computing Möbius functions=== ...

Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su === Computing Möbius functions=== ...

Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su === Computing Möbius functions=== ...

Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su === Computing Möbius functions=== ...

Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su === Computing Möbius functions=== ...

Generally, the '''Principle of Inclusion-Exclusion''' states the rule for computing the union of <math>n</math> finite sets <math>A_1,A_2,\ldots,A_n</math>, su === Computing Möbius functions=== ...

...for deterministic communication protocols, this is the best we can get for computing EQ. :Any deterministic communication protocol computing EQ on two <math>n</math>-bit strings costs <math>n</math> bits of communica ...

...]</math> by the definition of expectations. There is also a smarter way of computing <math>\mathbf{E}[X]</math>, by using indicators and the linearity of expec ...e need the following theorem, which holds generally and is very useful for computing the AND of many events. ...