11 – 20 of 66
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2022
-
Mark
Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification
2022) 2022 Design, Automation and Test in Europe Conference and Exhibition, DATE 2022 In Proceedings of the 2022 Design, Automation and Test in Europe Conference and Exhibition, DATE 2022 p.1431-1436(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Automating algebraic proof systems is NP-hard
2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
-
Mark
The power of negative reasoning
2021) 36th Computational Complexity Conference, CCC 2021 In Leibniz International Proceedings in Informatics, LIPIcs 200.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Learn to relax : Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
(
- Contribution to journal › Article
-
Mark
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
(
- Contribution to journal › Article
-
Mark
Proof complexity and SAT solving
2021) p.233-350(
- Chapter in Book/Report/Conference proceeding › Book chapter
- 2020
-
Mark
Lifting with simple gadgets and applications to circuit and proof complexity
2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.24-30(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
KRW composition theorems via lifting
2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.43-49(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding