4 search results - page 1 / 1 » coco 1993 |
COCO
1993
Springer
13 years 9 months ago
1993
Springer
COCO
1993
Springer
13 years 9 months ago
1993
Springer
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...
COCO
1993
Springer
13 years 9 months ago
1993
Springer
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...
COCO
1994
Springer
13 years 9 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...