2778 search results - page 6 / 556 » Limit complexities revisited |
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
APAL
2004
13 years 10 months ago
2004
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
SIAMSC
2008
13 years 10 months ago
2008
We are interested in the numerical approximation of the complex Ginzburg
COCO
1998
Springer
14 years 3 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...