Meet Taraviya

Meet Taraviya

MS Computer Science @UCLA / AI Researcher / IIT Bombay CSE graduate

Research seminar: Lower bounds for monotone circuits

less than 1 minute read

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.

Slides are available here.

You May Also Enjoy

Research seminar: Recursive Timed Automata

less than 1 minute read

Recursive Timed Automata (RTA) generalizes both Recursive State Machines and Timed Automata. This added power makes the problem of termination in RTA games u...