On the Complexity of finding stopping set size in Tanner Graphs.

K. Murali Krishnan Priti Shankar

Published in: CISS (2006)

Keyphrases

small number
database
neural network
computational complexity
memory requirements
polynomial time complexity
information retrieval
computational cost
probability distribution
worst case
feature set
hierarchical structure
directed graph
space complexity
graph theoretic