| Document Date: 2014-04-05 15:13:04
Open Document File Size: 310,89 KBShare Result on Facebook
City New York / / Company CNF / ACM Inc. / / Country United States / / Currency USD / / / Facility Penn Plaza / University of Toronto / University of Toronto RAHUL SANTHANAM / University of Edinburgh We / University of Edinburgh / / / IndustryTerm non-deterministic algorithm / propositional proof systems / natural algorithms / possible algorithm / non-deterministic algorithms / artificial algorithms / abstract devices / stronger proof systems / Proof systems / natural systems / low-depth proof systems / natural proof systems / / Organization University of Edinburgh We / National Science Foundation / University of Edinburgh / Institute for Advanced Study / University of Toronto / / Person Jan Kraj´ıc / RAHUL SANTHANAM / Ai / YUVAL FILMUS / TONIANN PITASSI / / / Position General / / ProvinceOrState New York / / Technology non-deterministic algorithms / BGJT algorithm / somewhat artificial algorithms / simulation / non-deterministic algorithm / possible algorithm / / URL http /
SocialTag |
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