Number of the records: 1
A Subexponential Lower Bound on Read-once Branching Programs by a New Argument
- 1.0403962 - UIVT-O 20000105 CZ eng V - Research Report
Žák, Stanislav
A Subexponential Lower Bound on Read-once Branching Programs by a New Argument.
Prague: ICS AS CR, 2000. 10 s. Technical Report, V-813.
R&D Projects: GA ČR GA201/98/0717
Institutional research plan: AV0Z1030915
Keywords : read-once branching programs * lower bound
Permanent Link: http://hdl.handle.net/11104/0124246
File Download Size Commentary Version Access v813-00.pdf 19 135.3 KB Other open-access
Number of the records: 1