103 search results - page 1 / 21 » The Arithmetical Complexity of Dimension and Randomness |
CSL
2003
Springer
13 years 10 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...
CC
2008
Springer
13 years 4 months ago
2008
Springer
We use derandomization to show that sequences of positive pspace-dimension
CIE
2006
Springer
13 years 8 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...