Multitask efficiencies in the decision tree model
In Direct Sum problems |8|, one tries to show that for a given computational model, the complexity of computing a collection F = {f[subscript 1](x[subscript 1]),[subscript hellip] f[subscript 1](x[subscript 1])} of finite functions on independent inputs is approximately the sum of their individual c...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers,
2010-10-08T20:06:35Z.
|
| Subjects: | |
| Online Access: | Get fulltext |