1450 search results - page 38 / 290 » On the Complexity of Hardness Amplification |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
STACS
2000
Springer
13 years 11 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...
AAAI
2008
13 years 10 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...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...