Sciweavers

COCO
1993
Springer
78views Algorithms» more  COCO 1993»
13 years 8 months ago
The Quantitative Structure of Exponential Time
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
Jack H. Lutz
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 8 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
COCO
1993
Springer
108views Algorithms» more  COCO 1993»
13 years 8 months ago
Some Structural Complexity Aspects of Neural Computation
José L. Balcázar, Ricard Gavald&agra...