2661 search results - page 70 / 533 » Quantum Complexity Classes |
144
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned...
127
click to vote
DAM
2008
15 years 6 months ago
2008
Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where th...
134
click to vote
COCO
1989
Springer
15 years 10 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
160
click to vote
CIE
2009
Springer
16 years 25 days ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
254
click to vote
IANDC
2008
15 years 6 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...