On the Nonapproximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs
Information and Computation - United States
doi 10.1006/inco.2002.3174
Full Text
Open PDFAbstract
Available in full text
Categories
Date
October 1, 2002
Authors
Publisher
Elsevier BV