Sciweavers

364 search results - page 9 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
CSL
2008
Springer
13 years 9 months ago
Recursion Schemata for NCk
Abstract. We give a recursion-theoretic characterization of the complexity classes NCk
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Mari...
LICS
1999
IEEE
13 years 11 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
SIROCCO
2001
13 years 8 months ago
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
An Interval Routing Scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assig...
Yashar Ganjali
EJC
1998
13 years 7 months ago
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
Wilfried Imrich, Sandi Klavzar
IEEEICCI
2003
IEEE
14 years 18 days ago
Signal Classification through Multifractal Analysis and Complex Domain Neural Networks
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...
Witold Kinsner, V. Cheung, K. Cannons, J. Pear, T....