Perfect Hashing, Graph Entropy, and Circuit Complexity.
Ilan NewmanPrabhakar RagdeAvi WigdersonPublished in: Computational Complexity Conference (1990)
Keyphrases
- information theory
- worst case
- structured data
- computational complexity
- mutual information
- information theoretic
- directed graph
- order preserving
- data structure
- digital circuits
- graph representation
- graph mining
- decision problems
- random walk
- connected components
- graph structure
- weighted graph
- hash functions
- graph partitioning
- computational cost
- feature space