Sciweavers

29908 search results - page 105 / 5982
» On the Complexity of
Sort
View
IPL
2007
121views more  IPL 2007»
13 years 10 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
TIT
2008
127views more  TIT 2008»
13 years 10 months ago
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
Let a biorthogonal Reed
Ilya Dumer, Gregory A. Kabatiansky, Cédric ...
TOC
2008
71views more  TOC 2008»
13 years 10 months ago
The One-Way Communication Complexity of Hamming Distance
Abstract: Consider the following version of the Hamming distance problem for
T. S. Jayram, Ravi Kumar, D. Sivakumar
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 10 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 10 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi