10988 search results - page 169 / 2198 » Algorithmic Folding Complexity |
137
Voted
ISAAC
2010
Springer
15 years 1 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...
128
Voted
STOC
2007
ACM
16 years 3 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...
108
click to vote
ISCAS
2003
IEEE
15 years 8 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...
107
click to vote
STACS
2000
Springer
15 years 7 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...
120
click to vote
AAAI
2008
15 years 5 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...