Author of the publication

Does Looking Inside a Circuit Help?.

, , , , and . MFCS, volume 83 of LIPIcs, page 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

 

Other publications of authors with the same name

Systems of bounded arithmetic from descriptive complexity.. University of Toronto, Canada, (2005)Stabbing Planes., , , , , , and . ITCS, volume 94 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Proof Complexity of SMT Solvers., , and . CAV (2), volume 10982 of Lecture Notes in Computer Science, page 275-293. Springer, (2018)AC0p Lower Bounds Against MCSP via the Coin Problem., , , , , and . ICALP, volume 132 of LIPIcs, page 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Complexity of Model Expansion., , , and . LPAR (Yogyakarta), volume 6397 of Lecture Notes in Computer Science, page 447-458. Springer, (2010)Mining Circuit Lower Bound Proofs for Meta-Algorithms., , , , and . Comput. Complex., 24 (2): 333-392 (2015)Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications., , , and . SODA, page 2162-2181. SIAM, (2017)Learning Algorithms from Natural Proofs., , , and . CCC, volume 50 of LIPIcs, page 10:1-10:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Expander Construction in VNC1., , , and . ITCS, volume 67 of LIPIcs, page 31:1-31:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Personalized Classifier Selection for EEG-Based BCIs., , and . Comput., 13 (7): 158 (July 2024)