Computational complexity of learning read-once formulas over different bases
| Authored By: | L. Hellerstein and M. Karpinski |
| Paper Title: | Computational complexity of learning read-once formulas over different bases |
| Publisher: | International Computer Science Institute, Berkeley, CA, TR-91-014 |
| Publication Date: | 1991 |