Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
Computational Complexity , VOLUME =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper establishes the first lower bounds on roABP-IPS refutation size for CNF formulas via a rank-based feasible interpolation argument.
citing papers explorer
-
An Improved Construction of Variety-Evasive Subspace Families
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
-
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.