Toniann Pitassi - PDFSEARCH.IO - Document Search Engine

Toniann Pitassi
Results: 11

#	Item
1	The Hardness of Being Private Anil Ada∗ , Arkadev Chattopadhyay† , Stephen Cook† , Lila Fontes† , Michal Kouck´y‡ , Toniann Pitassi† † Department of Computer Science, University of Toronto, Toronto, Canada Add to Reading List Source URL: www.cs.utoronto.ca Language: English - Date: 2012-04-06 11:02:11
2	Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication ¨ Mika Go¨ os Toniann Pitassi Add to Reading List Source URL: www.cs.utoronto.ca Language: English - Date: 2015-02-26 01:18:42
3	Communication Lower Bounds via Critical Block Sensitivity ¨ & Toniann Pitassi Mika Go¨ os University of Toronto Add to Reading List Source URL: www.cs.utoronto.ca Language: English - Date: 2014-01-12 15:29:51
4	Lower Bounds for Cutting Planes (Extended Abstract) Yuval Filmus, Toniann Pitassi University of Toronto May 15, 2011 Abstract Add to Reading List Source URL: www.cs.swan.ac.uk - Date: 2015-05-05 07:12:16
5	Pan-Private Streaming Algorithms Cynthia Dwork∗ Moni Naor† Toniann Pitassi‡ Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-05-25 09:43:30
6	Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-04-13 00:26:28 NP-complete problems Automated theorem proving Constraint programming Boolean algebra Formal methods DPLL algorithm Boolean satisfiability problem Conjunctive normal form Lookup table Theoretical computer science Applied mathematics Mathematics
7	Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook Department of Computer Science University of Toronto Toronto, Canada {yuvalf, toni, robere, sacoo Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-08-15 23:12:55 Order theory Computational complexity theory Functional analysis Monotonic function Real analysis Circuit complexity FO Aanderaa–Karp–Rosenberg conjecture Galois connection Theoretical computer science Mathematics Mathematical analysis
8	Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus∗∗ Toniann Pitassi∗† Robert Robere∗‡ Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-02-13 16:02:33 Order theory Computational complexity theory Functional analysis Monotonic function Real analysis Circuit complexity Aanderaa–Karp–Rosenberg conjecture Clique problem Mathematics Mathematical analysis Theoretical computer science
9	A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-05 15:13:04 Computational complexity theory Logic in computer science Mathematical logic Proof theory Automated theorem proving Frege system Proof complexity Function Switching lemma Theoretical computer science Mathematics Logic
10	Yuval Filmus Curriculum Vitæ Í 117 Oppenheimer Ln Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-10-31 15:18:39 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