Skip to search formSkip to main contentSkip to account menu

Hardy hierarchy

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this thesis study, we consider Poletsky-Stessin Hardy (PS-Hardy) spaces that are generated by continuous, plurisubharmonic… 
2011
2011
In this paper, we establish sufficient conditions for a singular integral T to be bounded from certain Hardy spaces H p L to… 
2000
2000
A general summability method of Fourier series and Fourier transforms is given with the help of an integrable function % having… 
1998
1998
Raspberry (Rubus idaeus L.) cultivars ‘Festival’, ‘Titan’ and ‘Willamette’ were cultured in vitro on three different media: (A… 
1990
1990
SummaryFifty-seven taxa belonging to 17 genera of testate rhizopods were recorded in samples of mosses, soils and lichens… 
1988
1988
The p-norm of the Hilbert transform is the same as the p-norm of its truncation to any Lebesgue measurable set with strictly… 
1986
1986
cereals (peas, summer fallow) and should Bruehl, G. W., Murray, T. D., and Allan, R. E. 1986. Resistance of winter wheats to have…