An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape.
Wolfgang MaassGeorg SchnitgerPublished in: Computational Complexity Conference (1986)
Keyphrases
- lower bound
- turing machine
- high speed
- optimal solution
- upper bound
- worst case
- magnetic tape
- optimal cost
- competitive ratio
- dynamic programming
- branch and bound algorithm
- constant factor
- data sets
- optimal control
- branch and bound
- objective function
- genetic algorithm
- real time
- closed form
- input data
- exhaustive search
- upper and lower bounds
- lagrangian relaxation
- np hard
- artificial neural networks
- read write
- strongly np hard