The optimal read-once branching program complexity for the direct storage access function

Beate Bollig. The optimal read-once branching program complexity for the direct storage access function. Inf. Process. Lett., 106(4):171-174, 2008. [doi]

Authors

Beate Bollig

This author has not been identified. Look up 'Beate Bollig' in Google