![Fellows of the Royal Society / International Colloquium on Automata / Languages and Programming / Automated theorem proving / Toniann Pitassi / Daniel Filmus / Symposium on Foundations of Computer Science / Symposium on Theoretical Aspects of Computer Science / Symposium on Theory of Computing / Combinatorics / Theoretical computer science / Applied mathematics / Computational complexity theory Fellows of the Royal Society / International Colloquium on Automata / Languages and Programming / Automated theorem proving / Toniann Pitassi / Daniel Filmus / Symposium on Foundations of Computer Science / Symposium on Theoretical Aspects of Computer Science / Symposium on Theory of Computing / Combinatorics / Theoretical computer science / Applied mathematics / Computational complexity theory](https://www.pdfsearch.io/img/40cf2e128a3d42566e39f9f7d4d05bb1.jpg) Date: 2014-10-31 15:18:39Fellows of the Royal Society International Colloquium on Automata Languages and Programming Automated theorem proving Toniann Pitassi Daniel Filmus Symposium on Foundations of Computer Science Symposium on Theoretical Aspects of Computer Science Symposium on Theory of Computing Combinatorics Theoretical computer science Applied mathematics Computational complexity theory | | Yuval Filmus Curriculum Vitæ Í 117 Oppenheimer LnAdd to Reading ListSource URL: www.cs.toronto.eduDownload Document from Source Website File Size: 249,99 KBShare Document on Facebook
|