Login / Signup
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3.
Jirí Síma
Stanislav Zák
Published in:
Fundam. Informaticae (2021)
Keyphrases
</>
special case
computational complexity