Toniann Pitassi
| Toniann Pitassi | |
|---|---|
| Residence | Toronto, Canada |
| Fields |
Mathematics Computer Science |
| Institutions | University of Toronto |
| Alma mater | University of Toronto |
| Doctoral advisor | Stephen Cook |
Toniann Pitassi is a Canadian and American mathematician and computer scientist specializing in computational complexity theory.
Academic career
A native of Pittsburgh, Pitassi earned bachelors and masters degrees at Pennsylvania State University before moving to the University of Toronto for her doctoral studies; she earned her Ph.D. in 1992 from Toronto under the supervision of Stephen Cook. After postdoctoral studies at the University of California, San Diego and faculty positions at the University of Pittsburgh and University of Arizona, she returned to Toronto in 2001, and is now a professor in the University of Toronto Department of Computer Science and University of Toronto Department of Mathematics.[1][2]
She was an invited speaker at International Congress of Mathematicians in Berlin in 1998.[3] She was the program chair for the 2012 Symposium on Theory of Computing.[4]
Research
Pitassi's research has largely focused on proof complexity, a branch of computational complexity theory that seeks upper and lower bounds on the lengths of mathematical proofs of logical propositions within various formalized proof systems. The goal of this study is to use these bounds to understand both the time complexity of proof-finding procedures, and the relative strengths of different proof systems.
Research contributions that she has made in this area include exponential lower bounds for Frege proofs of the pigeonhole principle,[5] exponential lower bounds for the cutting-plane method applied to propositions derived from the maximum clique problem,[6] exponential lower bounds for resolution proofs of dense random 3-satisfiability instances,[7] and subexponential upper bounds for the same dense random instances using the Davis–Putnam algorithm.[8] With Paul Beame, she also wrote a survey of proof complexity.[9]
Selected publications
- Pitassi, Toniann; Beame, Paul; Impagliazzo, Russell (1993), "Exponential lower bounds for the pigeonhole principle", Computational Complexity 3 (2): 97–140, doi:10.1007/BF01200117, MR 1233662.
- Beame, Paul; Pitassi, Toniann (1996), "Simplified and improved resolution lower bounds", Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 274–282, doi:10.1109/SFCS.1996.548486, MR 1450625.
- Bonet, Maria; Pitassi, Toniann; Raz, Ran (1997), "Lower bounds for cutting planes proofs with small coefficients", Journal of Symbolic Logic 62 (3): 708–728, doi:10.2307/2275569, MR 1472120.
- Beame, Paul; Pitassi, Toniann (1998), "Propositional proof complexity: past, present, and future", Bulletin of the European Association for Theoretical Computer Science (65): 66–89, MR 1650939. Reprinted in Current Trends in Theoretical Computer Science, World Scientific, 2001, MR 1886033.
- Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (1998), "On the complexity of unsatisfiability proofs for random k-CNF formulas", Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 561–571, doi:10.1145/276698.276870, MR 1715604.
- Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael (2002), "The efficiency of resolution and Davis-Putnam procedures", SIAM Journal on Computing 31 (4): 1048–1075, doi:10.1137/S0097539700369156, MR 1919956.
References
- ↑ Home page at U. Toronto, accessed 2011-12-24.
- ↑ Toniann Pitassi at the Mathematics Genealogy Project
- ↑ ICM Plenary and Invited Speakers since 1897
- ↑ STOC 2012 call for papers.
- ↑ Pitassi, Beame & Impagliazzo (1993).
- ↑ Bonet, Pitassi & Raz (1997).
- ↑ Beame & Pitassi (1996); Beame et al. (2002).
- ↑ Beame et al. (1998); Beame et al. (2002).
- ↑ Beame & Pitassi (1998).