Publication: A Tighter Analysis of Randomised Policy Iteration
Authors: Meet Taraviya, Shivaram Kalyanakrishnan
Authors: Meet Taraviya, Shivaram Kalyanakrishnan
Recursive Timed Automata (RTA) generalizes both Recursive State Machines and Timed Automata. This added power makes the problem of termination in RTA games u...
We demonstrate how color coding can be used to obtain algorithms with fixed parameter tractable complexity for NP-hard problems k-CYCLE and k-PATH.
We present lower bounds for the size of Monotone circuits computing the clique function. We use a combinatorial result called Sunflower Lemma for the proof.
Advisor: Krishna S.