The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock. The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. In Ding-Zhu Du, Guochuan Zhang, editors, Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings. Volume 7936 of Lecture Notes in Computer Science, pages 493-505, Springer, 2013. [doi]

This author has not been identified. Look up 'Hans-Joachim Böckenhauer' in GoogleThis author has not been identified. Look up 'Juraj Hromkovic' in GoogleThis author has not been identified. Look up 'Dennis Komm' in GoogleThis author has not been identified. Look up 'Sacha Krug' in GoogleThis author has not been identified. Look up 'Jasmin Smula' in GoogleThis author has not been identified. Look up 'Andreas Sprock' in Google

runs on WebDSL