Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
Title resolution pending
2 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1
external citations · OpenAlex
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
An Õ(Ω(n²)) lower bound for read-once parity branching programs is obtained by reducing to algebraic circuit lower bounds for an explicit function.
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.
-
A Lower Bound for Read-Once Parity Branching Programs
An Õ(Ω(n²)) lower bound for read-once parity branching programs is obtained by reducing to algebraic circuit lower bounds for an explicit function.