The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
Ramanujan graphs
3 Pith papers cite this work, alongside 1,003 external citations. Polarity classification is still indexing.
3
Pith papers citing it
1,003
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
The authors establish K_KR ≤ 694198146664396294486127753 / 34994834677886019996000000 ≈ 19.837, halving the original Kalton-Roberts upper bound.
citing papers explorer
-
Hard CNF Instances for Ideal Proof Systems
The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
-
On (In)approximability of MaxMin Independent Set Reconfiguration
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
-
Halving the original Kalton--Roberts upper bound for nearly additive set functions
The authors establish K_KR ≤ 694198146664396294486127753 / 34994834677886019996000000 ≈ 19.837, halving the original Kalton-Roberts upper bound.