Iddo Tzameret

activity

20112026

most citedAlgebraic Proof Complexity: Progress, Frontiers and Challenges

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2026 · cs.CCShow all

2 papers · 2 filters

cs.CC2026

The Weak Rank Principle: Lower Bounds and Applications

Michal Garl\'\ik, Svyatoslav Gryaznov, Hanlin Ren +1

Given two symbolic matrices $X$ and $Y$ of dimensions $m \times n$ and $n \times m$ , the *weak rank principle* (WRank) states the equation $X Y = A$ is unsatisfiable when $m > n$ and ra…

cs.CC2026

Hard CNF Instances for Ideal Proof Systems

Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret

Since the introduction of the Ideal Proof System (IPS) by Grochow and Pitassi (J. ACM 2018), a substantial body of work has established size lower bounds for IPS and its fragments.…