| Publication | Date of Publication | Type |
|---|
| On vanishing sums of roots of unity in polynomial calculus and sum-of-squares | 2024-08-06 | Paper |
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Computational Complexity | 2024-01-24 | Paper |
Circular (Yet Sound) Proofs in Propositional Logic
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
On the maximal part in unrefinable partitions of triangular numbers
Aequationes Mathematicae | 2023-04-19 | Paper |
Verification and generation of unrefinable partitions
Information Processing Letters | 2023-02-03 | Paper |
Clique Is Hard on Average for Regular Resolution
Journal of the ACM | 2022-12-08 | Paper |
Verification and generation of unrefinable partitions
(available as arXiv preprint) | 2021-12-30 | Paper |
On the maximal part in unrefinable partitions of triangular numbers
(available as arXiv preprint) | 2021-11-22 | Paper |
Upper bounds on positional Paris-Harrington games
Discrete Mathematics | 2021-01-27 | Paper |
| Graph colouring is hard for algorithms based on Hilbert's Nullstellensatz and Gröbner bases | 2020-05-26 | Paper |
Circular (yet sound) proofs
(available as arXiv preprint) | 2020-05-20 | Paper |
A rank lower bound for cutting planes proofs of Ramsey's theorem
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Clique is hard on average for regular resolution
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Algorithm analysis through proof complexity | 2018-09-06 | Paper |
A note about \(k\)-DNF resolution
Information Processing Letters | 2018-06-15 | Paper |
On semantic cutting planes with very small coefficients
Information Processing Letters | 2018-05-25 | Paper |
Cliques enumeration and tree-like resolution proofs
Information Processing Letters | 2018-04-05 | Paper |
The complexity of proving that a graph is Ramsey
Combinatorica | 2018-03-16 | Paper |
| Tight size-degree bounds for sums-of-squares proofs | 2018-01-24 | Paper |
| Semantic versus syntactic cutting planes | 2018-01-24 | Paper |
Tight size-degree bounds for sums-of-squares proofs
Computational Complexity | 2017-12-18 | Paper |
Tight size-degree bounds for sums-of-squares proofs
Computational Complexity | 2017-12-18 | Paper |
A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games
Information Processing Letters | 2017-11-03 | Paper |
On the proof complexity of Paris-Harrington and off-diagonal Ramsey tautologies
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
From small space to small width in resolution
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Narrow proofs may be maximally long
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
From small space to small width in resolution
(available as arXiv preprint) | 2017-03-03 | Paper |
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Parameterized bounded-depth Frege is not optimal
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Space Complexity in Polynomial Calculus
SIAM Journal on Computing | 2015-09-02 | Paper |
A characterization of tree-like resolution size
Information Processing Letters | 2014-04-11 | Paper |
Towards an understanding of polynomial calculus: new separations and lower bounds (extended abstract)
Automata, Languages, and Programming | 2013-08-06 | Paper |
The complexity of proving that a graph is Ramsey
Lecture Notes in Computer Science | 2013-08-06 | Paper |
A rank lower bound for cutting planes proofs of Ramsey's theorem
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Parameterized bounded-depth Frege is not optimal
Automata, Languages and Programming | 2011-07-06 | Paper |
Parameterized complexity of DPLL search procedures
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
On the automatizability of polynomial calculus
Theory of Computing Systems | 2010-10-06 | Paper |
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Minimum-energy broadcast and disk cover in grid wireless networks
Theoretical Computer Science | 2008-06-24 | Paper |
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science | 2007-10-02 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
