Boolean satisfiability (SAT) solvers are not only routinely used in the formal verification of large industrial problems, but also applied in safety-critical domains such as the railways, avionics, and automotive industries.
A classic counting algorithm, Kirchhoff's theorem gives a formula for finding the number of spanning trees in a simple, connected, undirected graph. I will discuss a simple proof of this theorem, based on elementary linear algebra.
In this talk, we introduce the `cafeteria or the banquet hall queuing problem' strongly motivated by speaker's experience of waiting in the TIFR cafeteria queue: Fixed but a large number of users arrive into a queue which provides service starting
Consider the problem: A committee interviews a stream of N candidates for selecting one. It has to accept or reject each candidate immediately after his/her interview.
