10608 search results - page 108 / 2122 » Complexity of O'Hara's Algorithm |
DAGSTUHL
2006
13 years 11 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
ISAAC
2010
Springer
13 years 8 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
ISCAS
2003
IEEE
14 years 3 months ago
2003
IEEE
In Exponentially-ModulatedFilter Bank (EMFB) the complex subfilters are generated from a real-valued prototype filter by multiplying the filter impulse response with complex expon...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...