Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets.
Michael I. DekhtyarPublished in: MFCS (1979)
Keyphrases
- computational complexity
- worst case
- special case
- upper bound
- lower bound
- approximation algorithms
- iterative refinement
- low complexity
- decision problems
- storage requirements
- np hard
- computational efficiency
- line segments
- computationally efficient
- np complete
- upper and lower bounds
- average case
- high computational complexity
- first order logic
- recursive algorithm
- equal length
- linear computational complexity