A typical problem in network design is to find a subgraph H of a given graph G such that H satisfies some connectivity requirements and has minimum cost.
Cryptographic primitives often define controlled access to (learning and influencing) information, permitting some kind of access while denying others.
We will discuss the MCMC method. We will talk about approximately counting the number of satisfying assignments of a DNF formula, approximately counting the number of independent sets in a graph, and (time permitting) the Metropolis Algorithm.
The notion of communication complexity (CC) was introduced by Yao in 1979, who investigated the following problem involving two separated parties (Alice and Bob).
We will study computations performed with limited memory. This will bring us into contact with several ideas in the area of randomness and computation. We will illustrate these ideas using the following toy example.
Mesh networks have become increasingly important because they can be easily implemented without much infrastructure and can support adequate bandwidth with a flexible multi-hop wireless communication among their routers serving the clients.
