PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Pitassi, Toniann"

Author of the publication

copydeleteadd this publication to your clipboard
Non-Automatizability of Bounded-Depth Frege Proofs.

, , , , and . Computational Complexity, 13 (1-2): 47-68 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Pitassi, Toniann
add a person with the name Pitassi, Toniann
 

Other publications of authors with the same name

A little advice can be very helpful., , , and . SODA, page 615-625. SIAM, (2012)On the Communication Complexity of High-Dimensional Permutations., , and . ITCS, volume 124 of LIPIcs, page 54:1-54:20. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Stabbing Planes., , , , , , and . ITCS, volume 94 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Upper and Lower Bounds for Tree-Like Cutting Planes Proofs, , and . LICS, page 220-228. IEEE Computer Society, (1994)Improved Separations between Nondeterministic and Randomized Multiparty Communication., , and . TOCT, 1 (2): 5:1-5:20 (2009)Linear and Negative Resolution are Weaker than Resolution, , and . Electronic Colloquium on Computational Complexity (ECCC), (2001)Minimizing DNF Formulas and AC0 Circuits Given a Truth Table, , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2005)Randomized Communication vs. Partition Number., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2015)Black-White Pebbling is PSPACE-Complete., and . Electronic Colloquium on Computational Complexity (ECCC), (2007)An Exponential Separation between Regular and General Resolution, , , and . Electronic Colloquium on Computational Complexity (ECCC), (2001)