The string guessing problem as a method to prove lower bounds on the advice complexity.
Hans-Joachim BöckenhauerJuraj HromkovicDennis KommSacha KrugJasmin SmulaAndreas SprockPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- objective function
- lower bound
- synthetic data
- dynamic programming
- computational cost
- experimental evaluation
- preprocessing
- cost function
- significant improvement
- support vector machine
- high accuracy
- high precision
- clustering method
- worst case
- edit distance
- main memory
- suffix tree
- detection method
- segmentation algorithm
- feature set
- upper bound
- computational complexity