ContributionNeither reading few bits twice nor reading illegally helps much
Under an Elsevier user license
open archive
Keywords
Complexity
Lower bounds
Branching programs
Switching-and-rectifier networks
Corrupting machines
Cited by (0)
- ∗
Supported by DFG grant Me 1077/10-1.
- 1
Supported by grant # 96-01-01222 of the Russian Basic Research Foundation, and by an AMS-FSU grant.
Copyright © 1998 Published by Elsevier B.V.