Lower bounds on the complexity of 1-time only branching programs (Preliminary version)

Publisher Website

25 January 2006

book chapter
Published by Springer Nature

p. 90-99
https://doi.org/10.1007/bfb0028795

Abstract

No abstract available

Keywords

This publication has 3 references indexed in Scilit:

Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
Information and Control, 1984
Bounds for width two branching programs
Published by Association for Computing Machinery (ACM) ,1983
The recognition problem for the set of perfect squares
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1966