1019 search results - page 48 / 204 » Uniform Functors on Sets |
GD
1994
Springer
13 years 11 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
MOC
2000
13 years 7 months ago
2000
The ultraconvergence property of a gradient recovery technique proposed by Zienkiewicz and Zhu is analyzed for the Laplace equation in the two dimensional setting. Under the assump...
JCSS
2011
13 years 2 months ago
2011
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
ECCC
2010
13 years 2 months ago
2010
The hybrid argument allows one to relate the distinguishability of a distribution (from uniform) to the predictability of individual bits given a prefix. The argument incurs a los...