Hardy hierarchy

In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is an ordinal-indexed family… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
0102019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2009
Review
2009
We use data from the National Longitudinal Study of Adolescent Health (N=7,686) to determine whether racial and ethnic… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2006
2006
We establish pointwise characterizations of functions in the HardySobolev spaces H within the range p ∈ (n/(n + 1), 1]. In… (More)
Is this relevant?
2005
2005
This paper is a sequel to [4]. It studies the moduli space of stable maps whereas [4] studied the moduli space of stable marked… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
  • Mikhail Borovoi, Zerv Rudnick z
  • 2005
We are interested in counting integer and rational points in affine algebraic varieties, also under congruence conditions. We… (More)
Is this relevant?
2001
2001
Do we really understand quantum mechanics? Strange correlations, paradoxes and theorems. Abstract This article presents a general… (More)
  • figure 1
Is this relevant?
2001
2001
  • M. HOFFMANN-OSTENHOF, T. HOFFMANN-OSTENHOF, Ari Laptev
  • 2001
We proof a version of Hardy’s type inequality in a domain Rn which involves the distance to the boundary and the volume of . In… (More)
Is this relevant?
2001
2001
It is shown that multilinear Calderón-Zygmund operators are bounded on products of Hardy spaces. 
Is this relevant?
2000
2000
We show that the classical Hardy inequalities with optimal constants in the Sobolev spaces W 1,p 0 and in higher-order Sobolev… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Introducing a suitable variational formulation for the local error of scattered data interpolation by radial basis functions (r… (More)
Is this relevant?