Pitassi, Toniann - Department of Computer Science, University of Toronto

• MINIMIZING DNF FORMULAS AND AC0 CIRCUITS GIVEN A TRUTH TABLE ERIC ALLENDER, LISA HELLERSTEIN, PAUL MCCABE , TONIANN PITASSI , AND MICHAEL
• Improved Depth Lower Bounds for Small Distance Connectivity Paul Beame \Lambda
• Non-automatizability of bounded-depth Frege Maria Luisa Bonet Carlos Domingo y Ricard Gavald a z
• Improved Separations between Nondeterministic and Randomized Multiparty Communication
• Simplified and Improved Resolution Lower Bounds Paul Beame \Lambda
• The Complexity of Resolution Refinements Joshua BureshOppenheim
• Exponential lower bounds and Integrality Gaps for Treelike Lov aszSchrijver Procedures
• The Relative Complexity of NP Search Problems Paul Beame \Lambda
• Lower bounds on Hilbert's Nullstellensatz and propositional proofs
• Doc. Math. J. DMV 1 Unsolvable systems of equations and proof complexity
• Towards lower bounds for boundeddepth Frege proofs with modular connectives
• Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
• Boundeddepth Frege lower bounds for weaker pigeonhole principles Josh BureshOppenheim
• Homogenization and the Polynomial Calculus Josh BureshOppenheim \Lambda
• Monotone circuits for the majority function Shlomo Hoory, Avner Magen, and Toniann Pitassi
• Bounded-depth Frege lower bounds for weaker pigeonhole Josh Buresh-Oppenheim
• Effectively Polynomial Simulations Toniann Pitassi1
• Algebraic Propositional Proof Systems Toniann Pitassi \Lambda
• ANew Proof of the Weak Pigeonhole Principle Alexis Maciel \Lambda
• Lower Bounds for Cutting Planes Proofs with Small Coefficients \Lambda
• Exponential lower bounds for the Treelike Haj'os Calculus \Lambda
• On Interpolation and Automatization for Frege Maria Luisa Bonet \Lambda Toniann Pitassi y Ran Raz z
• An Exponential Separation between Regular and General Michael Alekhnovich
• A Conditional Lower Bound for a System of ConstantDepth Proofs with Modular Connectives
• The efficiency of resolution and DavisPutnam procedures \Lambda Paul Beame y
• Resolution and the Weak Pigeonhole Principle Sam Buss #1 and Toniann Pitassi ##2
• The Complexity of the Haj'os Calculus \Lambda Toniann Pitassi Alasdair Urquhart
• Value Elimination: Bayesian Inference via Backtracking Search # Fahiem Bacchus
• Stochastic Boolean Satisfiability Michael L. Littman (mlittman@cs.duke.edu) \Lambda
• Upper and Lower Bounds for Treelike Cutting Planes Proofs
• Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle
• A GradientBased Boosting Algorithm for Regression Problems
• Clause Learning Can Effectively PSimulate General Propositional Resolution Tracking number: ????
• Regular Resolution Lower Bounds for the Weak Pigeonhole Principle
• Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua Buresh-Oppenheim
• Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling
• Integrality gaps of 2 -o(1) for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy
• A Strong Direct Product Theorem for Corruption and the Multiparty NOF Communication Complexity of Disjointness