Parametrized Complexity and Subexponential Time (Column: Computational Complexity).
Jörg FlumMartin GrohePublished in: Bull. EATCS (2004)
Keyphrases
- computational complexity
- high computational complexity
- decision problems
- worst case
- lower complexity
- memory requirements
- special case
- low complexity
- computationally efficient
- computational cost
- information retrieval
- relational databases
- objective function
- rate distortion
- computational efficiency
- multiscale
- case study
- social networks
- complexity analysis
- learning algorithm
- neural network
- complexity reduction